共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
In this paper, optimality conditions are presented and analyzed for the cardinality-constrained cone programming arising from finance, statistical regression, signal processing, etc. By introducing a restricted form of (strict) Robinson constraint qualification, the first-order optimality conditions for the cardinality-constrained cone programming are established based upon the properties of the normal cone. After characterizing further the second-order tangent set to the cardinality-constrained system, the second-order optimality conditions are also presented under some mild conditions. These proposed optimality conditions, to some extent, enrich the optimization theory for noncontinuous and nonconvex programming problems. 相似文献
3.
This paper investigates new first-order optimality conditions for general optimization problems. These optimality conditions are stronger than the commonly used M-stationarity conditions and are in particular useful when the latter cannot be applied because the underlying limiting normal cone cannot be computed effectively. We apply our optimality conditions to a MPEC to demonstrate their practicability.
相似文献4.
Zhiyou Wu Yongjian Yang Fusheng Bai Jing Tian 《Applied mathematics and computation》2012,218(11):6214-6231
In this paper some global optimality conditions for general quadratic {0, 1} programming problems with linear equality constraints are discussed and then some global optimality conditions for quadratic assignment problems (QAP) are presented. A local optimization method for (QAP) is derived according to the necessary global optimality conditions. A global optimization method for (QAP) is presented by combining the sufficient global optimality conditions, the local optimization method and some auxiliary functions. Some numerical examples are given to illustrate the efficiency of the given optimization methods. 相似文献
5.
No-gap optimality conditions for an optimal control problem with pointwise control-state constraints
An optimal control problem with pointwise mixed constraints of the instationary three-dimensional Navier–Stokes–Voigt equations is considered. We derive second-order optimality conditions and show that there is no gap between second-order necessary optimality conditions and second-order sufficient optimality conditions. In addition, the second-order sufficient optimality conditions for the problem where the objective functional does not contain a Tikhonov regularization term are also discussed. 相似文献
6.
Agnieszka B. Malinowska Delfim F.M. Torres 《Applied mathematics and computation》2012,218(9):5099-5111
The study of fractional variational problems in terms of a combined fractional Caputo derivative is introduced. Necessary optimality conditions of Euler-Lagrange type for the basic, isoperimetric, and Lagrange variational problems are proved, as well as transversality and sufficient optimality conditions. This allows to obtain necessary and sufficient Pareto optimality conditions for multiobjective fractional variational problems. 相似文献
7.
《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. 相似文献
8.
Second-order necessary optimality conditions play an important role in optimization theory. This is explained by the fact that most numerical optimization algorithms reduce to finding stationary points satisfying first-order necessary optimality conditions. As a rule, optimization problems, especially the high dimensional ones, have a lot of stationary points so one has to use second-order necessary optimality conditions to exclude nonoptimal points. These conditions are closely related to second-order constraint qualifications, which guarantee the validity of second-order necessary optimality conditions. In this paper, strong and weak second-order necessary optimality conditions are considered and their validity proved under so-called critical regularity condition at local minimizers. 相似文献
9.
群体多目标决策联合有效解类的不变凸充分条件 总被引:2,自引:0,他引:2
对于群体多目标决策问题,文[1]引进它的联合有效解类的概念,并给出这类解的最优性必要条件,在对于问题的目标函数和约束函数附加凸性的条件下,文[2]又给出了联合有效解类的最优性充分条件,本文进一步在目标函数和约束函数具不变凸和不变广义 凸的情况下,分别给出了联合有效解类的若干最优性充分条件。 相似文献
10.
Necessary and sufficient conditions in constrained optimization 总被引:22,自引:0,他引:22
Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient
for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions
are also given for optimality of the dual problem. Duality and converse duality are treated accordingly. 相似文献
11.
《Optimization》2012,61(6):1245-1260
ABSTRACTIn this paper, we derive some optimality and stationarity conditions for a multiobjective problem with equilibrium constraints (MOPEC). In particular, under a generalized Guignard constraint qualification, we show that any locally Pareto optimal solution of MOPEC must satisfy the strong Pareto Kuhn-Tucker optimality conditions. We also prove that the generalized Guignard constraint qualification is the weakest constraint qualification for the strong Pareto Kuhn-Tucker optimality. Furthermore, under certain convexity or generalized convexity assumptions, we show that the strong Pareto Kuhn-Tucker optimality conditions are also sufficient for several popular locally Pareto-type optimality conditions for MOPEC. 相似文献
12.
In this paper, we present Lagrange multiplier necessary conditions for global optimality that apply to non-convex optimization
problems beyond quadratic optimization problems subject to a single quadratic constraint. In particular, we show that our
optimality conditions apply to problems where the objective function is the difference of quadratic and convex functions over
a quadratic constraint, and to certain class of fractional programming problems. Our necessary conditions become necessary
and sufficient conditions for global optimality for quadratic minimization subject to quadratic constraint. As an application,
we also obtain global optimality conditions for a class of trust-region problems. Our approach makes use of outer-estimators,
and the powerful S-lemma which has played key role in control theory and semidefinite optimization. We discuss numerical examples
to illustrate the significance of our optimality conditions.
The authors are grateful to the referees for their useful comments which have contributed to the final preparation of the
paper. 相似文献
13.
Guo-lin Yu 《高校应用数学学报(英文版)》2017,32(2):225-236
There are two approaches of defining the solutions of a set-valued optimization problem:vector criterion and set criterion.This note is devoted to higher-order optimality conditions using both criteria of solutions for a constrained set-valued optimization problem in terms of higher-order radial derivatives.In the case of vector criterion,some optimality conditions are derived for isolated (weak) minimizers.With set criterion,necessary and sufficient optimality conditions are established for minimal solutions relative to lower set-order relation. 相似文献
14.
Necessary optimality conditions for efficient solutions of unconstrained and vector equilibrium problems with equality and inequality constraints are derived. Under assumptions on generalized convexity, necessary optimality conditions for efficient solutions become sufficient optimality conditions. Note that it is not required here that the ordering cone in the objective space has a nonempty interior. 相似文献
15.
16.
Z. Y. Wu J. Quan G. Q. Li J. Tian 《Journal of Optimization Theory and Applications》2012,153(2):408-435
Multivariate cubic polynomial optimization problems, as a special case of the general polynomial optimization, have a lot
of practical applications in real world. In this paper, some necessary local optimality conditions and some necessary global
optimality conditions for cubic polynomial optimization problems with mixed variables are established. Then some local optimization
methods, including weakly local optimization methods for general problems with mixed variables and strongly local optimization
methods for cubic polynomial optimization problems with mixed variables, are proposed by exploiting these necessary local
optimality conditions and necessary global optimality conditions. A global optimization method is proposed for cubic polynomial
optimization problems by combining these local optimization methods together with some auxiliary functions. Some numerical
examples are also given to illustrate that these approaches are very efficient. 相似文献
17.
In this paper, we study second-order optimality conditions for multiobjective optimization problems. By means of different
second-order tangent sets, various new second-order necessary optimality conditions are obtained in both scalar and vector
optimization. As special cases, we obtain several results found in the literature (see reference list). We present also second-order
sufficient optimality conditions so that there is only a very small gap with the necessary optimality conditions.
The authors thank Professor P.L. Yu and the referees for valuable comments and helpful suggestions. 相似文献
18.
This paper is mainly concerned with the necessary and sufficient conditions of optimality for Cauchy problem of higher order discrete and differential inclusions. Applying optimality conditions of problems with geometric constraints, for arbitrary higher order (say s-order) discrete inclusions optimality conditions are formulated. Also some special transversality conditions, which are peculiar to problems including third order derivatives are formulated. Formulation of sufficient conditions both for convex and non-convex discrete and differential inclusions are based on the apparatus of locally adjoint mappings. Furthermore, an application of these results is demonstrated by solving the problems with third order linear discrete and differential inclusions. 相似文献
19.
《Operations Research Letters》2021,49(4):616-622
It is well-known that the power-of-d choices routing algorithm maximizes throughput and is heavy-traffic optimal in load balancing systems with homogeneous servers. However, if the servers are heterogeneous, throughput optimality does not hold in general. We find necessary and sufficient conditions for throughput optimality of power-of-d choices when the servers are heterogeneous, and we prove that almost the same conditions are sufficient to show heavy-traffic optimality. Additionally, we generalize the sufficient condition for throughput optimality to a larger class of routing policies. 相似文献
20.
Le Quang Thuy Bui Thi Thanh Nguyen Thi Toan 《Journal of Optimization Theory and Applications》2017,173(2):421-442
Motivated by our recent works on optimality conditions in discrete optimal control problems under a nonconvex cost function, in this paper, we study second-order necessary and sufficient optimality conditions for a discrete optimal control problem with a nonconvex cost function and state-control constraints. By establishing an abstract result on second-order optimality conditions for a mathematical programming problem, we derive second-order necessary and sufficient optimality conditions for a discrete optimal control problem. Using a common critical cone for both the second-order necessary and sufficient optimality conditions, we obtain “no-gap” between second-order optimality conditions. 相似文献