Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
From MaRDI portal
Publication:1781864
DOI10.1007/S10957-004-1712-8zbMath1114.90083OpenAlexW2021295607MaRDI QIDQ1781864
Publication date: 9 June 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-004-1712-8
Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Related Items (19)
Stable and total Fenchel duality for composed convex optimization problems ⋮ Farkas-type results for vector-valued functions with applications ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS ⋮ On duality theory for non-convex semidefinite programming ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Complete characterizations of stable Farkas' lemma and cone-convex programming duality ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Revisiting some rules of convex analysis ⋮ Some convex programs without a duality gap ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
Cites Work
- Perfect duality for convexlike programs
- Generalizations of Slater's constraint qualification for infinite convex programs
- Zero duality gaps in infinite-dimensional programming
- Inequality systems and global optimization
- Characterizations of solution sets of convex vector minimization problems
- Results of farkas type
- A note on perfect duality and limiting lagrangeans
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Strong Duality for Semidefinite Programming
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
This page was built for publication: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
