Pages that link to "Item:Q3518741"
From MaRDI portal
The following pages link to A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces (Q3518741):
Displaying 28 items.
- Revisiting some rules of convex analysis (Q683299) (← links)
- On constraint qualifications of a nonconvex inequality (Q723504) (← links)
- On robust duality for fractional programming with uncertainty data (Q743463) (← links)
- Stable and total Fenchel duality for composed convex optimization problems (Q1617041) (← links)
- On several types of basic constraint qualifications via coderivatives for generalized equations (Q1637351) (← links)
- Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme (Q1706407) (← links)
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
- Min-sup-type zero duality gap properties for DC composite optimization problem (Q2067945) (← links)
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
- On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems (Q2254297) (← links)
- The stable duality of DC programs for composite convex functions (Q2358470) (← 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)
- On strong and total Lagrange duality for convex optimization problems (Q2473844) (← 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)
- On biconjugates of infimal functions (Q2808316) (← links)
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions (Q2970390) (← links)
- Duality for vector optimization problems via a general scalarization (Q3111136) (← links)
- Generalized Moreau–Rockafellar results for composed convex functions (Q3646097) (← links)
- Some characterizations of duality for DC optimization with composite functions (Q4559389) (← links)
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions (Q4986403) (← links)
- A new approach to strong duality for composite vector optimization problems (Q5009161) (← links)
- A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
- Optimality conditions and total dualities for conic programming involving composite function (Q5213372) (← links)
- High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces (Q6629773) (← links)
