Pages that link to "Item:Q2576721"
From MaRDI portal
The following pages link to A new geometric condition for Fenchel's duality in infinite dimensional spaces (Q2576721):
Displayed 36 items.
- Lagrange duality for evenly convex optimization problems (Q255070) (← links)
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality (Q352746) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
- Necessary and sufficient constraint qualification for surrogate duality (Q415371) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Farkas-type results for constrained fractional programming with DC functions (Q479261) (← links)
- Robust duality in parametric convex optimization (Q491220) (← links)
- Sandwich theorem for quasiconvex functions and its applications (Q531868) (← links)
- Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
- On set containment characterization and constraint qualification for quasiconvex programming (Q637546) (← links)
- Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
- Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus (Q765244) (← links)
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
- \(\varepsilon\)-optimality conditions for composed convex optimization problems (Q935086) (← links)
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions (Q946326) (← links)
- An application of the bivariate inf-convolution formula to enlargements of monotone operators (Q1005152) (← links)
- Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization (Q1939075) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- Sequential optimality conditions for fractional optimization with applications to vector optimization (Q2260685) (← links)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions (Q2438323) (← links)
- A dual criterion for maximal monotonicity of composition operators (Q2460925) (← links)
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions (Q2465563) (← links)
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities (Q2474349) (← links)
- The strong conical hull intersection property for convex programming (Q2490330) (← links)
- Necessary and sufficient conditions for stable conjugate duality (Q2492483) (← links)
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation (Q2566244) (← links)
- Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior (Q2895670) (← links)
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality (Q2897278) (← 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)