On epsilon-stability in optimization
From MaRDI portal
Publication:684048
DOI10.1007/s10013-017-0265-8zbMath1411.90271OpenAlexW2768171504MaRDI QIDQ684048
Publication date: 9 February 2018
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-017-0265-8
Fenchel dualityconjugate duality\(\epsilon\)-stability\(\epsilon\)-duality gapcone constraint optimizationquasi relative interior
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Duality theory (optimization) (49N15)
Related Items
Duality for constrained robust sum optimization problems ⋮ Duality for Optimization Problems with Infinite Sums
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Separation of sets and Wolfe duality
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Conjugate duality in convex optimization
- Epigraphical analysis
- A note on d-stability of convex programs and limiting Lagrangians
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Zero duality gaps in infinite-dimensional programming
- Stability of the duality gap in linear optimization
- Separation theorem based on the quasirelative interior and application to duality theory
- Duality gap in convex programming
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- The \(\varepsilon\)-strategy in variational analysis: illustration with the closed convexification of a function
- Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces
- Infinite dimensional duality and applications
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- On the use of the quasi-relative interior in optimization
- Vector Optimization and Monotone Operators via Convex Duality
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- On three open problems related to quasi relative interior
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Variational Analysis
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Strong Duality in Cone Constrained Nonconvex Optimization
- Conditions for zero duality gap in convex programming
