A Comparison of Some Recent Regularity Conditions for Fenchel Duality
DOI10.1007/978-1-4419-9569-8_7zbMath1258.46030OpenAlexW1608675586MaRDI QIDQ2897278
Radu Ioan Boţ, Ernö Robert Csetnek
Publication date: 10 July 2012
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-9569-8_7
convex optimizationregularity conditionsFenchel dualityalgebraic interiorquasi-interiorgeneralized interior point regularity conditionsclosedness-type regularity conditions
Nonlinear programming (90C30) Programming in abstract spaces (90C48) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Conjugate duality in convex optimization
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Notions of relative interior in Banach spaces
- Separation theorem based on the quasirelative interior and application to duality theory
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
- General infinite dimensional duality and applications to evolutionary network equilibrium problems
- From Hahn--Banach to monotonicity
- Infinite dimensional duality and applications
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Solvability results for sublinear functions and operators
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- ON A SEPARATION THEOREM INVOLVING THE QUASI-RELATIVE INTERIOR
This page was built for publication: A Comparison of Some Recent Regularity Conditions for Fenchel Duality
