首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 765 毫秒
1.
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.  相似文献   

2.
Necessary conditions are derived for optimal control problems subject to isoperimetric constraints and for optimal control problems with inequality constraints at the terminal time. The conditions are derived by transforming the problem into the standard form of optimal control problems and then using Pontryagin's principle.  相似文献   

3.
In this paper, we investigated vector equilibrium problems and gave the scalarization results for weakly efficient solutions, Henig efficient solutions, and globally efficient solutions to the vector equilibrium problems without the convexity assumption. Using nonsmooth analysis and the scalarization results, we provided the necessary conditions for weakly efficient solutions, Henig efficient solutions, globally efficient solutions, and superefficient solutions to vector equilibrium problems. By the assumption of convexity, we gave sufficient conditions for those solutions. As applications, we gave the necessary and sufficient conditions for corresponding solutions to vector variational inequalities and vector optimization problems.  相似文献   

4.
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.  相似文献   

5.
Necessary and/or sufficient conditions are stated in order to have regularity for nondifferentiable problems or differentiable problems. These conditions are compared with some known constraint qualifications.  相似文献   

6.
The inverse problems are under study for the Helmholtz equation describing acoustic scattering at a three-dimensional inclusion. Some optimization method reduces these problems to the inverse extremum problems with variable refraction index and boundary source density as controls. We prove that these problems are solvable and derive the optimality systems that describe necessary optimality conditions. Analysis of the optimality systems leads us to some sufficient conditions on the input data ensuring the uniqueness and stability of optimal solutions.  相似文献   

7.
通过引入广义弧连通概念,在Rn空间中,研究极大极小非凸分式规划问题的最优性充分条件及其对偶问题.首先获得了极大极小非凸分式规划问题的最优性充分条件;然后建立分式规划问题的一个对偶模型并得到了弱对偶定理,强对偶定理和逆对偶定理.  相似文献   

8.
In this paper, we develop necessary conditions for global optimality that apply to non-linear programming problems with polynomial constraints which cover a broad range of optimization problems that arise in applications of continuous as well as discrete optimization. In particular, we show that our optimality conditions readily apply to problems where the objective function is the difference of polynomial and convex functions over polynomial constraints, and to classes of fractional programming problems. Our necessary conditions become also sufficient for global optimality for polynomial programming problems. Our approach makes use of polynomial over-estimators and, a polynomial version of a theorem of the alternative which is a variant of the Positivstellensatz in semi-algebraic geometry. We discuss numerical examples to illustrate the significance of our optimality conditions.  相似文献   

9.
In this paper, well-posedness of generalized quasi-variational inclusion problems and of optimization problems with generalized quasi-variational inclusion problems as constraints is introduced and studied. Some metric characterizations of well-posedness for generalized quasi-variational inclusion problems and for optimization problems with generalized quasi-variational inclusion problems as constraints are given. The equivalence between the well-posedness of generalized quasi-variational inclusion problems and the existence of solutions of generalized quasi-variational inclusion problems is given under suitable conditions.  相似文献   

10.
We consider a class of age-structured control problems with nonlocal dynamics and boundary conditions. For these problems we suggest Arrow-type sufficient conditions for optimality of problems defined on finite as well as infinite time intervals. We examine some models as illustrations (optimal education and optimal offence control problems).  相似文献   

11.
Necessary conditions of optimality are derived for optimal control problems with pathwise state constraints, in which the dynamic constraint is modelled as a differential inclusion. The novel feature of the conditions is the unrestrictive nature of the hypotheses under which these conditions are shown to be valid. An Euler Lagrange type condition is obtained for problems where the multifunction associated with the dynamic constraint has values possibly unbounded, nonconvex sets and satisfies a mild `one-sided' Lipschitz continuity hypothesis. We recover as a special case the sharpest available necessary conditions for state constraint free problems proved in a recent paper by Ioffe. For problems where the multifunction is convex valued it is shown that the necessary conditions are still valid when the one-sided Lipschitz hypothesis is replaced by a milder, local hypothesis. A recent `dualization' theorem permits us to infer a strengthened form of the Hamiltonian inclusion from the Euler Lagrange condition. The necessary conditions for state constrained problems with convex valued multifunctions are derived under hypotheses on the dynamics which are significantly weaker than those invoked by Loewen and Rockafellar to achieve related necessary conditions for state constrained problems, and improve on available results in certain respects even when specialized to the state constraint free case.

Proofs make use of recent `decoupling' ideas of the authors, which reduce the optimization problem to one to which Pontryagin's maximum principle is applicable, and a refined penalization technique to deal with the dynamic constraint.

  相似文献   


12.
非局部反应扩散方程奇摄动问题   总被引:1,自引:0,他引:1  
本文研究了一类具有非局部初始条件的奇摄动反应扩散问题.在适当的条件下,利用比较定理讨论了问题解的渐近性态.  相似文献   

13.
In the present work, we intend to derive conditions characterizing globally optimal solutions of quadratic 0-1 programming problems. By specializing the problem of maximizing a convex quadratic function under linear constraints, we find explicit global optimality conditions for quadratic 0-1 programming problems, including necessary and sufficient conditions and some necessary conditions. We also present some global optimality conditions for the problem of minimization of half-products.  相似文献   

14.
We consider infinite horizon fractional variational problems, where the fractional derivative is defined in the sense of Caputo. Necessary optimality conditions for higher-order variational problems and optimal control problems are obtained. Transversality conditions are obtained in the case state functions are free at the initial time.  相似文献   

15.
In this paper, we present the necessary and sufficient conditions for weakly efficient solution, Henig efficient solution, globally efficient solution, and superefficient solution to the vector equilibrium problems with constraints. As applications, we give the necessary and sufficient conditions for corresponding solution to the vector variational inequalities and vector optimization problems.  相似文献   

16.
We give some necessary and sufficient conditions which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. We also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case when we deal with convex optimization problems having infinitely many convex inequalities as constraints the conditions we work with turn into the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities, recently used in the literature. Moreover, we show that our new results extend some existing ones in the literature.  相似文献   

17.
The Kuhn-Tucker Sufficiency Theorem states that a feasible point that satisfies the Kuhn-Tucker conditions is a global minimizer for a convex programming problem for which a local minimizer is global. In this paper, we present new Kuhn-Tucker sufficiency conditions for possibly multi-extremal nonconvex mathematical programming problems which may have many local minimizers that are not global. We derive the sufficiency conditions by first constructing weighted sum of square underestimators of the objective function and then by characterizing the global optimality of the underestimators. As a consequence, we derive easily verifiable Kuhn-Tucker sufficient conditions for general quadratic programming problems with equality and inequality constraints. Numerical examples are given to illustrate the significance of our criteria for multi-extremal problems.  相似文献   

18.
We establish new necessary and sufficient optimality conditions for global optimization problems. In particular, we establish tractable optimality conditions for the problems of minimizing a weakly convex or concave function subject to standard constraints, such as box constraints, binary constraints, and simplex constraints. We also derive some new necessary and sufficient optimality conditions for quadratic optimization. Our main theoretical tool for establishing these optimality conditions is abstract convexity.  相似文献   

19.
In this paper, we present sufficient global optimality conditions for weakly convex minimization problems using abstract convex analysis theory. By introducing (L,X)-subdifferentials of weakly convex functions using a class of quadratic functions, we first obtain some sufficient conditions for global optimization problems with weakly convex objective functions and weakly convex inequality and equality constraints. Some sufficient optimality conditions for problems with additional box constraints and bivalent constraints are then derived.   相似文献   

20.
We consider initial-boundary value problems for systems of shallow-water equations. Using the testfunction method proposed by Pokhozhaev and Mitidieri, we study the effects of the boundary values and initial conditions on the occurrence, duration, and rate of blowup of the solutions of these problems. Under natural boundary conditions, we prove the existence of blowup in one- and two-dimensional problems in bounded and unbounded regions with dissipation and dispersion.  相似文献   

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

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