Pages that link to "Item:Q1781864"
From MaRDI portal
The following pages link to Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864):
Displaying 23 items.
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization (Q618891) (← links)
- On duality theory for non-convex semidefinite programming (Q646659) (← links)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
- Functional inequalities and theorems of the alternative involving composite functions (Q743970) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- Some convex programs without a duality gap (Q959958) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Sequential characterization of solutions in convex composite programming and applications to vector optimization (Q1008785) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- Stable and total Fenchel duality for composed convex optimization problems (Q1617041) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Farkas-type results for vector-valued functions with applications (Q2363561) (← links)
- Sequential optimality conditions for composed convex optimization problems (Q2481905) (← links)
- A sequential convex program approach to an inverse linear semidefinite programming problem (Q2821091) (← links)
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS (Q3520507) (← links)
- A closedness condition and its applications to DC programs with convex constraints (Q3577846) (← links)
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces (Q4989940) (← links)
- New Farkas-type constraint qualifications in convex infinite programming (Q5428420) (← links)
- (Q5447477) (← links)
