Pages that link to "Item:Q2492444"
From MaRDI portal
The following pages link to An alternative formulation for a new closed cone constraint qualification (Q2492444):
Displayed 34 items.
- Lagrange duality for evenly convex optimization problems (Q255070) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming (Q412765) (← links)
- Necessary and sufficient constraint qualification for surrogate duality (Q415371) (← links)
- A complete characterization of strong duality in nonconvex optimization with a single constraint (Q454276) (← links)
- On set containment characterization and constraint qualification for quasiconvex programming (Q637546) (← links)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces (Q929661) (← links)
- The conjugate of the pointwise maximum of two convex functions revisited (Q934811) (← links)
- \(\varepsilon\)-optimality conditions for composed convex optimization problems (Q935086) (← links)
- Revisiting some duality theorems via the quasirelative interior in convex optimization (Q956615) (← 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)
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints (Q1036159) (← links)
- Characterizations via linear scalarization of minimal and properly minimal elements (Q1653287) (← links)
- Some constraint qualifications for quasiconvex vector-valued systems (Q1945503) (← links)
- Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
- Duality theorems for separable convex programming without qualifications (Q2359787) (← links)
- A Lagrange duality approach for multi-composed optimization problems (Q2408520) (← links)
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← 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)
- New constraint qualification and conjugate duality for composed convex optimization problems (Q2465467) (← links)
- On strong and total Lagrange duality for convex optimization problems (Q2473844) (← links)
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities (Q2474349) (← links)
- Lagrange multipliers and infinite-dimensional equilibrium problems (Q2481083) (← links)
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. (Q2490774) (← links)
- Asymptotic optimality conditions for linear semi-infinite programming (Q2790886) (← links)
- On biconjugates of infimal functions (Q2808316) (← links)
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements (Q3225066) (← links)
- A closedness condition and its applications to DC programs with convex constraints (Q3577846) (← links)