Recommendations
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Characterizations of \(\epsilon\)-duality gap statements and \(\varepsilon\)-optimality conditions for composite optimization problems with conic constraints
- scientific article; zbMATH DE number 1014815
- Differential stability of convex optimization problems with possibly empty solution sets
- On the Stability of the Feasible Set in Optimization Problems
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 4046373 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3590940 (Why is no real title available?)
- scientific article; zbMATH DE number 1117855 (Why is no real title available?)
- scientific article; zbMATH DE number 5245384 (Why is no real title available?)
- scientific article; zbMATH DE number 3412414 (Why is no real title available?)
- scientific article; zbMATH DE number 3075425 (Why is no real title available?)
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- A note on d-stability of convex programs and limiting Lagrangians
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- Conditions for zero duality gap in convex programming
- Conjugate duality in convex optimization
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Duality gap in convex programming
- Epigraphical analysis
- Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Infinite dimensional duality and applications
- On the use of the quasi-relative interior in optimization
- On three open problems related to quasi relative interior
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Separation of sets and Wolfe duality
- Separation theorem based on the quasirelative interior and application to duality theory
- Stability of the duality gap in linear optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Strong duality in cone constrained nonconvex optimization
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- The \(\varepsilon\)-strategy in variational analysis: illustration with the closed convexification of a function
- Variational Analysis
- Vector optimization and monotone operators via convex duality. Recent advances
- Zero duality gap and attainment with possibly non-convex data
- Zero duality gaps in infinite-dimensional programming
Cited in
(4)
This page was built for publication: On epsilon-stability in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684048)
