A new geometric condition for Fenchel's duality in infinite dimensional spaces
From MaRDI portal
Publication:2576721
DOI10.1007/s10107-005-0614-3zbMath1093.90077OpenAlexW1981414252WikidataQ58048564 ScholiaQ58048564MaRDI QIDQ2576721
Regina Sandra Burachik, Vaithilingam Jeyakumar
Publication date: 14 December 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0614-3
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Existence of solutions for minimax problems (49J35)
Related Items (46)
Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] ⋮ Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior ⋮ A Comparison of Some Recent Regularity Conditions for Fenchel Duality ⋮ Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ On several types of basic constraint qualifications via coderivatives for generalized equations ⋮ An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ Multivariate Monotone Inclusions in Saddle Form ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization ⋮ Exact SDP relaxations for classes of nonlinear semidefinite programming problems ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ On set containment characterization and constraint qualification for quasiconvex programming ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Constraint qualifications characterizing Lagrangian duality in convex optimization ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ Robust duality in parametric convex optimization ⋮ A dual criterion for maximal monotonicity of composition operators ⋮ A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions ⋮ Generalized Fenchel's conjugation formulas and duality for abstract convex functions ⋮ Revisiting some rules of convex analysis ⋮ Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities ⋮ The forward-backward algorithm and the normal problem ⋮ Sandwich theorem for quasiconvex functions and its applications ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ The strong conical hull intersection property for convex programming ⋮ Necessary and sufficient conditions for stable conjugate duality ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ On constraint qualifications of a nonconvex inequality ⋮ An application of the bivariate inf-convolution formula to enlargements of monotone operators ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ Duality for Optimization Problems with Infinite Sums ⋮ Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ A variable smoothing algorithm for solving convex optimization problems ⋮ Lagrange duality for evenly convex optimization problems ⋮ Optimization of boundary value problems for higher order differential inclusions and duality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalizations of Slater's constraint qualification for infinite convex programs
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Fenchel duality in infinite-dimensional setting and its applications.
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- The Fenchel duality theorem in Fréchet spaees
- The occasional distributivity of ∘ over+e and the change of variable formula for conjugate functions
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Duality and infinite dimensional optimization
This page was built for publication: A new geometric condition for Fenchel's duality in infinite dimensional spaces
