Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
From MaRDI portal
Publication:1781864
Recommendations
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- scientific article; zbMATH DE number 5245384
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Sequential optimality conditions for composed convex optimization problems
- On sequential optimality conditions for smooth constrained optimization
- On sequential optimality conditions for smooth constrained optimization
- A sequential convex program approach to an inverse linear semidefinite programming problem
- scientific article; zbMATH DE number 4070639
Cites work
- A note on perfect duality and limiting lagrangeans
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- Characterizations of solution sets of convex vector minimization problems
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Generalizations of Slater's constraint qualification for infinite convex programs
- Inequality systems and global optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Perfect duality for convexlike programs
- Results of farkas type
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Strong Duality for Semidefinite Programming
- Zero duality gaps in infinite-dimensional programming
Cited in
(26)- Functional inequalities and theorems of the alternative involving composite functions
- Sequential characterization of solutions in convex composite programming and applications to vector optimization
- Some convex programs without a duality gap
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- A qualification free sequential Pshenichnyi-Rockafellar lemma and convex semidefinite
- Stable and total Fenchel duality for composed convex optimization problems
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- A closedness condition and its applications to DC programs with convex constraints
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- scientific article; zbMATH DE number 5245384 (Why is no real title available?)
- scientific article; zbMATH DE number 1552283 (Why is no real title available?)
- On duality theory for non-convex semidefinite programming
- Farkas-type results for vector-valued functions with applications
- Revisiting some rules of convex analysis
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Sequential optimality conditions for composed convex optimization problems
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- New Farkas-type constraint qualifications in convex infinite programming
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- A sequential convex program approach to an inverse linear semidefinite programming problem
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
This page was built for publication: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781864)
