首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 390 毫秒
1.
Convexity plays a very important role in optimization for establishing optimality conditions. Different works have shown that the convexity property can be replaced by a weaker notion, the invexity. In particular, for problems with inequality-type constraints, Martin defined a weaker notion of invexity, the Karush-Kuhn-Tucker-invexity (hereafter KKT-invexity), that is both necessary and sufficient to obtain Karush-Kuhn-Tucker-type optimality conditions. It is well known that for this result to hold the problem has to verify a constraint qualification, i.e., it must be regular or non-degenerate. In non-regular problems, the classical optimality conditions are totally inapplicable. Meaningful results were obtained for problems with inequality-type constraints by Izmailov. They are based on the 2-regularity condition of the constraints at a feasible point. In this work, we generalize Martin's result to non-regular problems by defining an analogous concept, the 2-KKT-invexity, and using the characterization of the tangent cone in the 2-regular case and the necessary optimality condition given by Izmailov.  相似文献   

2.
《Optimization》2012,61(5):619-625
Convexity and generalized convexity play a central role in mathematical economics and optimization theory. So, the research on criteria for convexity or generalized convexity is one of the most important aspects in mathematical programming, in order to characterize the solutions set. Many efforts have been made in the few last years to weaken the convexity notions. In this article, taking in mind Craven's notion of K-invexity function (when K is a cone in ? n ) and Martin's notion of Karush–Kuhn–Tucker invexity (hereafter KKT-invexity), we define a new notion of generalized convexity that is both necessary and sufficient to ensure every KKT point is a global optimum for programming problems with conic constraints. This new definition is a generalization of KKT-invexity concept given by Martin and K-invexity function given by Craven. Moreover, it is the weakest to characterize the set of optimal solutions. The notions and results that exist in the literature up to now are particular instances of the ones presented here.  相似文献   

3.
We introduce a concept of generalized invexity for the nonsmooth continuous time optimization problems, namely, the concept of Karush-Kuhn-Tucker (KKT) invexity. Then, we prove that this notion is necessary and sufficient for global optimality of a KKT point. We also extend the notion of weak-invexity for nonsmooth continuous time optimization problems. Further, we show that weak-invexity is a necessary and sufficient condition for weak duality.  相似文献   

4.
In this paper it is shown that every generalized Kuhn-Tucker point of a vector optimization problem involving locally Lipschitz functions is a weakly efficient point if and only if this problem is KT- pseudoinvex in a suitable sense. Under a closedness assumption (in particular, under a regularity condition of the constraint functions) it is pointed out that in this result the notion of generalized Kuhn–Tucker point can be replaced by the usual notion of Kuhn–Tucker point. Some earlier results in (Martin (1985), The essence of invexity, J. Optim. Theory Appl., 47, 65–76. Osuna-Gómez et al., (1999), J. Math. Anal. Appl., 233, 205–220. Osuna-GGómez et al., (1998), J. Optim. Theory Appl., 98, 651–661. Phuong et al., (1995) J. Optim. Theory Appl., 87, 579–594) results are included as special cases of ours. The paper also contains characterizations of HC-invexity and KT- invexity properties which are sufficient conditions for KT- pseudoinvexity property of nonsmooth problems.Mathematics Subject Classifications: 90C29, 26B25  相似文献   

5.
It is well-known in optimal control theory that the maximum principle, in general, furnishes only necessary optimality conditions for an admissible process to be an optimal one. It is also well-known that if a process satisfies the maximum principle in a problem with convex data, the maximum principle turns to be likewise a sufficient condition. Here an invexity type condition for state constrained optimal control problems is defined and shown to be a sufficient optimality condition. Further, it is demonstrated that all optimal control problems where all extremal processes are optimal necessarily obey this invexity condition. Thus optimal control problems which satisfy such a condition constitute the most general class of problems where the maximum principle becomes automatically a set of sufficient optimality conditions.  相似文献   

6.
For certain Bolza problems with linear dynamics, two sets extending the notion of conjugate points in the calculus of variations are introduced. Independently of nonsingularity assumptions, their emptiness, in one case without normality assumptions, is shown to be equivalent to a second order necessary condition. A comparison with other notions available in the literature is given.  相似文献   

7.
The notion of invexity was introduced into optimization theory by Hanson in 1981 as a very broad generalization of convexity. A smooth mathematical program of the form minimizef(x), subject tog(x) ≦ 0, isxD ? ? n invex if there exists a function η:D ×D → ? n such that, for allx, uD, $$\begin{gathered} f(x) - f(u) - f'(u)n(x,u) \geqq 0, \hfill \\ g(x) - g(u) - g'(u)n(x,u) \geqq 0. \hfill \\ \end{gathered}$$ The convex case corresponds of course to η(x, u)≡x?u; but, as Hanson showed, invexity is sufficient to imply both weak duality and that the Kuhn-Tucker conditions are sufficient for global optimality. It is shown here that elementary relaxations of the conditions defining invexity lead to modified invexity notions which are both necessary and sufficient for weak duality and Kuhn-Tucker sufficiency.  相似文献   

8.
In this paper, we consider a nondifferentiable multiobjective semi-infinite optimization problem. We introduce a qualification condition and derive strong Karusk Kuhn Tucker(KKT) necessary conditions. Then a sufficient optimality condition is proved under invexity assumptions.  相似文献   

9.
In this paper we define two notions: Kuhn–Tucker saddle point invex problem with inequality constraints and Mond–Weir weak duality invex one. We prove that a problem is Kuhn–Tucker saddle point invex if and only if every point, which satisfies Kuhn–Tucker optimality conditions forms together with the respective Lagrange multiplier a saddle point of the Lagrange function. We prove that a problem is Mond–Weir weak duality invex if and only if weak duality holds between the problem and its Mond–Weir dual one. Additionally, we obtain necessary and sufficient conditions, which ensure that strong duality holds between the problem with inequality constraints and its Wolfe dual. Connections with previously defined invexity notions are discussed.  相似文献   

10.
刘证 《数学季刊》1996,11(3):79-86
We introduce the notion of K-very smoothness which is a generalization of very smoothness in Banach spaces. A necessary and sufficient condition for a Banach space to be K-very smooth is obtained. We also consider some relations between K-very smoothness and other geometrical notions.  相似文献   

11.
The study of Martin‐Löf randomness on a computable metric space with a computable measure has seen much progress recently. In this paper we study Martin‐Löf randomness on a more general space, that is, a computable topological space with a computable measure. On such a space, Martin‐Löf randomness may not be a natural notion because there is no universal test, and Martin‐Löf randomness and complexity randomness (defined in this paper) do not coincide in general. We show that SCT3 is a sufficient condition for the existence and coincidence, and study how much we can weaken this condition.  相似文献   

12.
In non-regular problems the classical optimality conditions are totally inapplicable. Meaningful results were obtained for problems with conic constraints by Izmailov and Solodov (SIAM J Control Optim 40(4):1280–1295, 2001). They are based on the so-called 2-regularity condition of the constraints at a feasible point. It is well known that generalized convexity notions play a very important role in optimization for establishing optimality conditions. In this paper we give the concept of Karush–Kuhn–Tucker point to rewrite the necessary optimality condition given in Izmailov and Solodov (SIAM J Control Optim 40(4):1280–1295, 2001) and the appropriate generalized convexity notions to show that the optimality condition is both necessary and sufficient to characterize optimal solutions set for non-regular problems with conic constraints. The results that exist in the literature up to now, even for the regular case, are particular instances of the ones presented here.  相似文献   

13.
In this paper, we introduce a new space of fuzzy numbers equipped with a scalar product defined in this space. The notion of a derivative of a fuzzy function in this space is defined. By employing these notions, an optimal control problem with non-linear functional is formulated and an optimality condition is obtained in the form of maximum principle. Using this result, the numerical algorithm is offered for the solution of such problems.  相似文献   

14.
《Optimization》2012,61(4):527-537
Using a special scalarization, we give necessary optimality conditions for fractional multiobjective optimization problems. Under a generalized invexity, sufficient optimality conditions are also given. All over the article, the data are assumed to be continuous but not necessarily Lipschitz.  相似文献   

15.
The paper is devoted to the study of a new notion of linear suboptimality in constrained mathematical programming. This concept is different from conventional notions of solutions to optimization-related problems, while seems to be natural and significant from the viewpoint of modern variational analysis and applications. In contrast to standard notions, it admits complete characterizations via appropriate constructions of generalized differentiation in nonconvex settings. In this paper we mainly focus on various classes of mathematical programs with equilibrium constraints (MPECs), whose principal role has been well recognized in optimization theory and its applications. Based on robust generalized differential calculus, we derive new results giving pointwise necessary and sufficient conditions for linear suboptimality in general MPECs and its important specifications involving variational and quasivariational inequalities, implicit complementarity problems, etc. Research was partially supported by the National Science Foundation under grant DMS-0304989 and by the Australian Research Council under grant DP-0451168.  相似文献   

16.
17.
In this paper some concepts and techniques of Mathematical Programming are extended in an intrinsic way from the Euclidean space to the sphere. In particular, the notion of convex functions, variational problem and monotone vector fields are extended to the sphere and several characterizations of these notions are shown. As an application of the convexity concept, necessary and sufficient optimality conditions for constrained convex optimization problems on the sphere are derived.  相似文献   

18.
In this paper, vector equilibrium problems with constraint in Banach spaces are investigated. Kuhn–Tucker-like conditions for weakly efficient solutions are given by using the Gerstewitz’s function and nonsmooth analysis. Moreover, the sufficient conditions of weakly efficient solutions are established under the assumption of generalized invexity. As applications, necessary conditions of weakly efficient solutions for vector variational inequalities with constraint and vector optimization problems with constraint are obtained.  相似文献   

19.
In this paper, we obtain necessary and sufficient second order optimality conditions for multiobjective problems using second order directional derivatives. We propose the notion of second order KT-pseudoinvex problems and we prove that this class of problems has the following property: a problem is second order KT-pseudoinvex if and only if all its points that satisfy the second order necessary optimality condition are weakly efficient. Also we obtain second order sufficient conditions for efficiency.  相似文献   

20.
To compare two randomness notions with each other, we ask whether a given randomness notion can be defined via another randomness notion. Inspired by Yu's pioneering study, we formalize our question using the concept of relativization of randomness. We give some solutions to our formalized questions. Also, our results include the affirmative answer to the problem asked by Yu in a discussion with the second author, i.e., whether Schnorr randomness relative to the halting problem is equivalent to Martin‐Löf randomness relative to all low 1‐generic reals.  相似文献   

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

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