Pages that link to "Item:Q2473844"
From MaRDI portal
The following pages link to On strong and total Lagrange duality for convex optimization problems (Q2473844):
Displaying 39 items.
- Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming (Q412765) (← links)
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Attouch-Théra duality revisited: Paramonotonicity and operator splitting (Q452068) (← links)
- Farkas-type results for constrained fractional programming with DC functions (Q479261) (← links)
- Robust duality in parametric convex optimization (Q491220) (← links)
- Necessary optimality conditions for nonsmooth semi-infinite programming problems (Q537966) (← links)
- On set containment characterization and constraint qualification for quasiconvex programming (Q637546) (← links)
- On robust duality for fractional programming with uncertainty data (Q743463) (← links)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs (Q849329) (← links)
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces (Q929661) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Duality gap of the conic convex constrained optimization problems in normed spaces (Q1013974) (← links)
- Convex and convex-like optimization over a range inclusion problem and first applications (Q1693857) (← links)
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
- Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems (Q2254297) (← links)
- Sequential optimality conditions for fractional optimization with applications to vector optimization (Q2260685) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q2336429) (← links)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- The stable duality of DC programs for composite convex functions (Q2358470) (← links)
- Duality theorems for separable convex programming without qualifications (Q2359787) (← links)
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions (Q2438323) (← links)
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems (Q2440517) (← links)
- Sequential optimality conditions for composed convex optimization problems (Q2481905) (← links)
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces (Q2516052) (← links)
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints (Q2656086) (← links)
- Optimality conditions for non-smooth semi-infinite programming (Q2786319) (← links)
- On biconjugates of infimal functions (Q2808316) (← links)
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems (Q2817240) (← links)
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements (Q3225066) (← links)
- Generalized Moreau–Rockafellar results for composed convex functions (Q3646097) (← links)
- Some characterizations of duality for DC optimization with composite functions (Q4559389) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q5088817) (← links)
- Optimality conditions and total dualities for conic programming involving composite function (Q5213372) (← links)