首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
A short note about exposed points in real banach spaces   总被引:1,自引:0,他引:1  
We express the set of exposed points in terms of rotund points and non-smooth points.As long as we have Banach spaces each time"bigger",we consider sets of non-smooth points each time"smaller".  相似文献   

2.
In this paper, we establish relationships between vector variational-like inequality problems and non-smooth vector optimization problems under non-smooth invexity. We identify the vector critical points, the weakly efficient points and the solutions of the non-smooth weak vector variational-like inequality problems, under non-smooth pseudo-invexity assumptions. These conditions are more general than those existing in the literature.  相似文献   

3.
In this paper, we establish some relationships between vector variational-like inequality and non-smooth vector optimization problems under the assumptions of α-invex non-smooth functions. We identify the vector critical points, the weakly efficient points and the solutions of the weak vector variational-like inequality, under non-smooth pseudo-α-invexity assumptions. These conditions are more general than those of existing ones in the literature. In particular, this work extends an earlier work of Ruiz-Garzon et al. (J Oper Res 157:113–119, 2004) to a wider class of functions, namely the non-smooth pseudo-α-invex functions. Moreover, this work extends an earlier work of Mishra and Noor (J Math Anal Appl 311:78–84, 2005) to non-differentiable case.  相似文献   

4.
In this paper, we study some relationships between interval-valued vector optimization problems and vector variational inequalities under the assumptions of LU-convex smooth and non-smooth objective functions. We identify the weakly efficient points of the interval-valued vector optimization problems and the solutions of the weak vector variational inequalities under smooth and non-smooth LU-convexity assumptions.  相似文献   

5.
Minimax problems can be approached by reformulating them into smooth problems with constraints or by dealing with the non-smooth objective directly. We focus on verified enclosures of all globally optimal points of such problems. In smooth problems in branch and bound algorithms, interval Newton methods can be used to verify existence and uniqueness of solutions, to be used in eliminating regions containing such solutions, and point Newton methods can be used to obtain approximate solutions for good upper bounds on the global optimum. We analyze smooth reformulation approaches, show weaknesses in them, and compare reformulation to solving the non-smooth problem directly. In addition to analysis and illustrative problems, we exhibit the results of numerical computations on various test problems.  相似文献   

6.
Motivated by Nash equilibrium problems on ‘curved’ strategy sets, the concept of Nash–Stampacchia equilibrium points is introduced via variational inequalities on Riemannian manifolds. Characterizations, existence, and stability of Nash–Stampacchia equilibria are studied when the strategy sets are compact/noncompact geodesic convex subsets of Hadamard manifolds, exploiting two well-known geometrical features of these spaces both involving the metric projection map. These properties actually characterize the non-positivity of the sectional curvature of complete and simply connected Riemannian spaces, delimiting the Hadamard manifolds as the optimal geometrical framework of Nash–Stampacchia equilibrium problems. Our analytical approach exploits various elements from set-valued and variational analysis, dynamical systems, and non-smooth calculus on Riemannian manifolds. Examples are presented on the Poincaré upper-plane model and on the open convex cone of symmetric positive definite matrices endowed with the trace-type Killing form.  相似文献   

7.
利用广义B-凸函数等概念,讨论了一类非光滑多目标规划,给出了广义最优性充分条件和Mond-Weir型对偶结果,讨论了向量Lagrange乘子性质并证明了向量值鞍点定理。  相似文献   

8.
We prove a non-smooth generalization of the global implicit function theorem. More precisely we use the non-smooth local implicit function theorem and the non-smooth critical point theory in order to prove a non-smooth global implicit function theorem for locally Lipschitz functions. A comparison between several global inversion theorems is discussed. Applications to algebraic equations are given.  相似文献   

9.
A general approach to Bayesian isotonic changepoint problems is developed. Such isotonic changepoint analysis includes trends and other constraint problems and it captures linear, non-smooth as well as abrupt changes. Desired marginal posterior densities are obtained using a Markov chain Monte Carlo method. The methodology is exemplified using one simulated and two real data examples, where it is shown that our proposed Bayesian approach captures the qualitative conclusion about the shape of the trend change.  相似文献   

10.
In this article, we obtain the weak and strong rates of convergence of time integrals of non-smooth functions of a one dimensional diffusion process. We propose the use of the exact simulation scheme to simulate the process at discretization points. In particular, we also present the rates of convergence for the weak and strong errors of approximation for the local time of a one dimensional diffusion process as an application of our method.  相似文献   

11.
Victor Didenko  Johan Helsing 《PAMM》2013,13(1):435-438
This paper deals with approximate solutions to integral equations arising in boundary value problems for the biharmonic equation in simply connected piecewise smooth domains. The approximation method considered demonstrates excellent convergence even in the case of boundary conditions discontinuous at corner points. In an application we obtain very accurate approximations for some characteristics of two-dimensional Stokes flow in non-smooth domains. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

12.
In the first part of this work, the local singularity of non-smooth dynamical systems was discussed and the criteria for the grazing bifurcation were presented mathematically. In this part, the fragmentation mechanism of strange attractors in non-smooth dynamical systems is investigated. The periodic motion transition is completed through grazing. The concepts for the initial and final grazing, switching manifolds are introduced for six basic mappings. The fragmentation of strange attractors in non-smooth dynamical systems is described mathematically. The fragmentation mechanism of the strange attractor for such a non-smooth dynamical system is qualitatively discussed. Such a fragmentation of the strange attractor is illustrated numerically. The criteria and topological structures for the fragmentation of the strange attractor need to be further developed as in hyperbolic strange attractors. The fragmentation of the strange attractors extensively exists in non-smooth dynamical systems, which will help us better understand chaotic motions in non-smooth dynamical systems.  相似文献   

13.
We investigate the convergence of subgradient-oriented descent methods in non-smooth non-convex optimization. We prove convergence in the sense of subsequences for functions with a strict standard model, and we show that convergence to a single critical point may be guaranteed if the Kurdyka–?ojasiewicz inequality is satisfied. We show, by way of an example, that the Kurdyka–?ojasiewicz inequality alone is not sufficient to prove the convergence to critical points.  相似文献   

14.
We consider the numerical simulation of contact problems in elasticity with large deformations. The non-penetration condition is described by means of a signed distance function to the obstacle's boundary. Techniques from level set methods allow for an appropriate numerical approximation of the signed distance function preserving its non-smooth character. The emerging non-convex optimization problem subject to non-smooth inequality constraints is solved by a non-smooth multiscale SQP method in combination with a non-smooth multigrid method as interior solver. Several examples in three space dimensions including applications in biomechanics illustrate the capability of our methods.  相似文献   

15.
《Optimization》2012,61(4):401-412
The aim of this article is to study the relationship between generalized Minty vector variational inequalities and non-smooth vector optimization problems. Under pseudoconvexity or pseudomonotonicity, we establish the relationship between an efficient solution of a non-smooth vector optimization problem and a generalized Minty vector variational inequality. This offers a non-smooth version of existing Minty variational principle.  相似文献   

16.
We extend a recent result of Ricceri concerning the existence of three critical points of certain non-smooth functionals. Two applications are given, both in the theory of differential inclusions; the first one concerns a non-homogeneous Neumann boundary value problem, the second one treats a quasilinear elliptic inclusion problem in the whole \mathbb RN{\mathbb R^N}.  相似文献   

17.
In this paper we employ two recent analytical approaches to investigate the possible classes of traveling wave solutions of some members of a recently-derived integrable family of generalized Camassa–Holm (GCH) equations. A recent, novel application of phase-plane analysis is employed to analyze the singular traveling wave equations of three of the GCH NLPDEs, i.e. the possible non-smooth peakon and cuspon solutions. One of the considered GCH equations supports both solitary (peakon) and periodic (cuspon) cusp waves in different parameter regimes. The second equation does not support singular traveling waves and the last one supports four-segmented, non-smooth M-wave solutions.Moreover, smooth traveling waves of the three GCH equations are considered. Here, we use a recent technique to derive convergent multi-infinite series solutions for the homoclinic orbits of their traveling-wave equations, corresponding to pulse (kink or shock) solutions respectively of the original PDEs. We perform many numerical tests in different parameter regime to pinpoint real saddle equilibrium points of the corresponding GCH equations, as well as ensure simultaneous convergence and continuity of the multi-infinite series solutions for the homoclinic orbits anchored by these saddle points. Unlike the majority of unaccelerated convergent series, high accuracy is attained with relatively few terms. We also show the traveling wave nature of these pulse and front solutions to the GCH NLPDEs.  相似文献   

18.
In this paper we study second order non-linear periodic systems driven by the ordinary vectorp-Laplacian with a non-smooth, locally Lipschitz potential function. Our approach is variational and it is based on the non-smooth critical point theory. We prove existence and multiplicity results under general growth conditions on the potential function. Then we establish the existence of non-trivial homoclinic (to zero) solutions. Our theorem appears to be the first such result (even for smooth problems) for systems monitored by thep-Laplacian. In the last section of the paper we examine the scalar non-linear and semilinear problem. Our approach uses a generalized Landesman-Lazer type condition which generalizes previous ones used in the literature. Also for the semilinear case the problem is at resonance at any eigenvalue.  相似文献   

19.
This paper investigates the stability of periodic delay systems with non-smooth coefficients using a multi-interval Chebyshev collocation approach (MIC). In this approach, each piecewise continuous interval is expanded in a Chebyshev basis of the first order. The boundaries of these intervals are placed at the points of discontinuity to recover the fast convergence properties of spectral methods. Stability is examined for a set of case studies that contain the complexities of periodic coefficients, delays and discontinuities. The new approach is also compared to the conventional Chebyshev collocation method.  相似文献   

20.
《Optimization》2012,61(7):1013-1032
In this article we study non-smooth Lipschitz programming problems with set inclusion and abstract constraints. Our aim is to develop approximate optimality conditions for minimax programming problems in absence of any constraint qualification. The optimality conditions are worked out not exactly at the optimal solution but at some points in a neighbourhood of the optimal solution. For this reason, we call the conditions as approximate optimality conditions. Later we extend the results in terms of the limiting subdifferentials in presence of an appropriate constraint qualification thereby leading to the optimality conditions at the exact optimal point.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号