Necessary and sufficient global optimality conditions for convex maximization revisited
From MaRDI portal
Publication:1378644
DOI10.1006/jmaa.1997.5745zbMath0909.90223OpenAlexW2033345364MaRDI QIDQ1378644
Marco Locatelli, Mirjam Dür, Reiner Horst
Publication date: 13 April 1999
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1997.5745
Convex programming (90C25) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items
Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ A review of recent advances in global optimization ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Piece adding technique for convex maximization problems ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ On the maximization of (not necessarily) convex functions on convex sets ⋮ Global minimization algorithms for concave quadratic programming problems ⋮ Global minimization of difference of quadratic and convex functions over box or binary constraints ⋮ DC programming: overview. ⋮ Optimality conditions of first order for global minima of locally Lipschitz functions ⋮ Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions ⋮ Inscribed ball and enclosing box methods for the convex maximization problem ⋮ A new concave minimization algorithm for the absolute value equation solution ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Optimality conditions in global optimization and their applications ⋮ CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
- Some further duality theorems for optimization problems with reverse convex constraint sets
- Duality in nonconvex optimization
- A duality principle for non-convex optimisation and the calculus of variations
- A finite algorithm for solving general quadratic problems
- Using copositivity for global optimality criteria in concave quadratic programming problems
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Introduction to global optimization
- Solving sum of ratios fractional programs via concave minimization
- When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?
- Global minimization of a difference of two convex functions
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- A Fenchel-Rockafellar type duality theorem for maximization
