首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
This article proposes a few tangent cones,which are relative to the constraint qualifications of optimization problems.With the upper and lower directional derivatives of an objective function,the characteristics of cones on the constraint qualifications are presented.The interrelations among the constraint qualifications,a few cones involved, and level sets of upper and lower directional derivatives are derived.  相似文献   

2.
For a nonempty closed set C in a real normed vector space X and an inequality solution set, we present several sufficient conditions for the tangent and contingent cones to their intersection to contain the intersections of the corresponding cones. We not only express the contingent cone to a solution set of inequalities and equalities by the directional (or Fréchet) derivatives of the active inequality constraint functions and the Fréchet derivatives of the equality constraint functions but also the tangent cone by the Clarke (or lower Dini, or upper Dini) derivatives of the active inequality constraint functions and the directional derivatives of the equality constraint functions. By using a simple property of the function dCdCc, we characterize these cones by the hypertangent and hypercontingent vectors to the set C. Furthermore, these results allow us to present new constraint qualifications for the Karush-Kuhn-Tucker conditions.  相似文献   

3.
引进了一种二阶切导数,借助该切导数给出了变序结构集值优化问题取得局部弱非控点的二阶最优性必要条件.在某种特殊情况下,给出了一阶最优性条件.通过修正的Dubovitskij-Miljutin切锥导出的约束规格,给出了两个集值映射之和的二阶相依切导数的关系式,进一步得到目标函数与变锥函数的二阶相依切导数分开形式的最优性必要条件.  相似文献   

4.
讨论了一类步进应力的加速退化试验,在试验假定下,以退化失效分布平均寿命的极大似然估计与其真值的接近程度为标准得到一个精度限制.然后根据试验的过程得到了试验成本函数的一般表达形式.在估计精度的限制之下,最小化成本函数,以此得出试验的最优设计模型.最后,给出了一个数值例子,展示了优化设计的过程.  相似文献   

5.
Central Swaths     
We develop a natural generalization to the notion of the central path, a concept that lies at the heart of interior-point methods for convex optimization. The generalization is accomplished via the “derivative cones” of a “hyperbolicity cone”, the derivatives being direct and mathematically appealing relaxations of the underlying (hyperbolic) conic constraint, be it the non-negative orthant, the cone of positive semidefinite matrices, or other. We prove that a dynamics inherent to the derivative cones generates paths always leading to optimality, the central path arising from a special case in which the derivative cones are quadratic. Derivative cones of higher degree better fit the underlying conic constraint, raising the prospect that the paths they generate lead to optimality quicker than the central path.  相似文献   

6.
Linear vector semi-infinite optimization deals with the simultaneous minimization of finitely many linear scalar functions subject to infinitely many linear constraints. This paper provides characterizations of the weakly efficient, efficient, properly efficient and strongly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The global constraint qualifications are illustrated on a collection of selected applications.  相似文献   

7.
In this paper, we investigate relations between constraint qualifications in quasiconvex programming. At first, we show a necessary and sufficient condition for the closed cone constraint qualification for quasiconvex programming (Q-CCCQ), and investigate some sufficient conditions for the Q-CCCQ. Also, we consider a relation between the Q-CCCQ and the basic constraint qualification for quasiconvex programming (Q-BCQ) and we compare the Q-BCQ with some constraint qualifications.  相似文献   

8.
通过模糊数的结构元表示方法,利用两个单调函数的自反单调变换构造了等式限定算子,推广了文[6]中的等式限定运算,处理了存在负模糊情况下关于乘法运算的不可逆问题.同时,本文还将等式限定运算推广到模糊值函数上,提出了模糊值函数等式限定运算的结构元方法,解决了模糊值函数运算的不可逆问题.  相似文献   

9.
In this paper, we consider higher-order Karush–Kuhn–Tucker optimality conditions in terms of radial derivatives for set-valued optimization with nonsolid ordering cones. First, we develop sum rules and chain rules in the form of equality for radial derivatives. Then, we investigate set-valued optimization including mixed constraints with both ordering cones in the objective and constraint spaces having possibly empty interior. We obtain necessary conditions for quasi-relative efficient solutions and sufficient conditions for Pareto efficient solutions. For the special case of weak efficient solutions, we receive even necessary and sufficient conditions. Our results are new or improve recent existing ones in the literature.  相似文献   

10.
Three constraint qualifications (the weak generalized Robinson constraint qualification, the bounded constraint qualification, and the generalized Abadie constraint qualification), which are weaker than the generalized Robinson constraint qualification (GRCQ) given by Yen (1997) [1], are introduced for constrained Lipschitz optimization problems. Relationships between those constraint qualifications and the calmness of the solution mapping are investigated. It is demonstrated that the weak generalized Robinson constraint qualification and the bounded constraint qualification are easily verifiable sufficient conditions for the calmness of the solution mapping, whereas the proposed generalized Abadie constraint qualification, described in terms of graphical derivatives in variational analysis, is weaker than the calmness of the solution mapping. Finally, those constraint qualifications are written for a mathematical program with complementarity constraints (MPCC), and new constraint qualifications ensuring the C-stationary point condition of a MPCC are obtained.  相似文献   

11.
This paper presents an exact formula for computing the normal cones of the constraint set mapping including the Clarke normal cone and the Mordukhovich normal cone in infinite programming under the extended Mangasarian-Fromovitz constraint qualification condition. Then, we derive an upper estimate as well as an exact formula for the limiting subdifferential of the marginal/optimal value function in a general Banach space setting.  相似文献   

12.
We deal with the differential conditions for local optimality. The conditions that we derive for inequality constrained problems do not require constraint qualifications and are the broadest conditions based on only first-order and second-order derivatives. A similar result is proved for equality constrained problems, although the necessary conditions require the regularity of the equality constraints.  相似文献   

13.
In this paper we consider a convex-composite generalized constraint equation in Banach spaces. Using variational analysis technique, in terms of normal cones and coderivatives, we first establish sufficient conditions for such an equation to be metrically subregular. Under the Robinson qualification, we prove that these conditions are also necessary for the metric subregularity. In particular, some existing results on error bound and metric subregularity are extended to the composite-convexity case from the convexity case.  相似文献   

14.
This paper is devoted to the introduction and development of new dual-space constructions of generalized differentiation in variational analysis, which combine certain features of subdifferentials for nonsmooth functions (resp. normal cones to sets) and directional derivatives (resp. tangents). We derive some basic properties of these constructions and apply them to optimality conditions in problems of unconstrained and constrained optimization.  相似文献   

15.
Universal duality in conic convex optimization   总被引:1,自引:0,他引:1  
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both problems are infeasible, in which case the optimal values are +∞ and −∞. In contrast, for optimization problems over nonpolyhedral convex cones, a nonzero duality gap can exist when either the primal or the dual is feasible. For a pair of dual conic convex programs, we provide simple conditions on the ``constraint matrices' and cone under which the duality gap is zero for every choice of linear objective function and constraint right-hand side. We refer to this property as ``universal duality'. Our conditions possess the following properties: (i) they are necessary and sufficient, in the sense that if (and only if) they do not hold, the duality gap is nonzero for some linear objective function and constraint right-hand side; (ii) they are metrically and topologically generic; and (iii) they can be verified by solving a single conic convex program. We relate to universal duality the fact that the feasible sets of a primal convex program and its dual cannot both be bounded, unless they are both empty. Finally we illustrate our theory on a class of semidefinite programs that appear in control theory applications. This work was supported by a fellowship at the University of Maryland, in addition to NSF grants DEMO-9813057, DMI0422931, CUR0204084, and DoE grant DEFG0204ER25655. Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the National Science Foundation or those of the US Department of Energy.  相似文献   

16.
We use normal directions of the outcome set to develop a method of outer approximation for solving generalized convex multiobjective programming problems. We prove the convergence of the method and report some computational experiments. As an application, we obtain an algorithm to solve an associated multiplicative problem over a convex constraint set.  相似文献   

17.
We consider nonsmooth constrained optimization problems with semicontinuous and continuous data in Banach space and derive necessary conditions without constraint qualification in terms of smooth subderivatives and normal cones. These results, in different versions, are set in reflexive and smooth Banach spaces.

  相似文献   


18.
In finite dimensions, the outer semicontinuity of a set-valued mapping is equivalent to the closedness of its graph. In this article, we study the outer semicontinuity of set-valued mappings in connection with their convexifications and linearizations in finite and infinite dimensions. The results are specified to the case where the mappings involved are given by subdifferentials of extended real-valued functions or normal cones to sets. Our developments are important for applications to second-order calculus in variational analysis in which the outer semicontinuity plays a crucial role.  相似文献   

19.
In this paper, we introduce and develop the theory of restricted normal cones which generalize the classical Mordukhovich normal cone. We thoroughly study these objects from the viewpoint of constraint qualifications and regularity. Numerous examples are provided to illustrate the theory. This work provides the theoretical underpinning for a subsequent article in which these tools are applied to obtain a convergence analysis of the method of alternating projections for nonconvex sets.  相似文献   

20.
In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient for global or local optimality under some MPEC generalized convexity assumptions. Moreover, we propose new constraint qualifications for M-stationary conditions to hold. These new constraint qualifications include piecewise MFCQ, piecewise Slater condition, MPEC weak reverse convex constraint qualification, MPEC Arrow-Hurwicz-Uzawa constraint qualification, MPEC Zangwill constraint qualification, MPEC Kuhn-Tucker constraint qualification, and MPEC Abadie constraint qualification.  相似文献   

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

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