Regularity Conditions via Quasi-Relative Interior in Convex Programming

Recommendations

Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
Partially finite convex programming. I: Quasi relative interiors and duality theory
Revisiting some duality theorems via the quasirelative interior in convex optimization
A Comparison of Some Recent Regularity Conditions for Fenchel Duality
New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces

Cited in

(53)

On generalized Nash equilibrium in infinite dimension: the Lagrange multipliers approach
Duality and its applications to optimality conditions with nonsolid cones
Motzkin's theorem of the alternative: a continuous-time generalization
On epsilon-stability in optimization
Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets
Optimality conditions of vector set-valued optimization problem involving relative interior
Quasi-relative interiors for graphs of convex set-valued mappings
A Comparison of Some Recent Regularity Conditions for Fenchel Duality
On proper separation theorems by means of the quasi-relative interior with applications
Characterizations of improvement sets via quasi interior and applications in vector optimization
A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
On optimality conditions for quasi-relative efficient solutions in set-valued optimization
Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
Mas-Colell properness condition and almost convexity in nonconvex optimization
Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors
scientific article; zbMATH DE number 59345 (Why is no real title available?)
Image convexity of generalized systems with infinite-dimensional image and applications
Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
Partially finite convex programming. I: Quasi relative interiors and duality theory
Set-valued systems with infinite-dimensional image and applications
Duality theory and applications to unilateral problems
On several types of basic constraint qualifications via coderivatives for generalized equations
scientific article; zbMATH DE number 7194401 (Why is no real title available?)
Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors
A complete characterization of strong duality in nonconvex optimization with a single constraint
The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
Convex analysis in groups and semigroups and applications to separation and optimization
Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
Characterizations via linear scalarization of minimal and properly minimal elements
On some erroneous statements in the paper ``Optimality conditions for extended Ky Fan inequality with cone and affine constraints and their applications by A. Capătă
Face relative interior of convex sets in topological vector spaces
New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
Refinements on gap functions and optimality conditions for vector quasi-equilibrium problems via image space analysis
The relation between pseudonormality and quasiregularity in constrained optimization
Looking for appropriate qualification conditions for subdifferential formulae and dual representations for convex risk measures
On duality theory in vector spaces without topology via algebraic core
Robust conjugate duality for convex optimization under uncertainty with application to data classification
Vector quasi-equilibrium problems: separation, saddle points and error bounds for the solution set
Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones
New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
Optimality conditions for strong vector equilibrium problems under a weak constraint qualification
Generalized relative interiors and generalized convexity in infinite-dimensional spaces
Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
Infinite-dimensional vector optimization and a separation theorem
On the use of the quasi-relative interior in optimization
A mixed type duality for nonsmooth multiobjective semi-infinite problems with mixed constraints
Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
Duality and Farkas-type results for DC fractional programming with DC constraints
Stable and total Fenchel duality for composed convex optimization problems

This page was built for publication: Regularity Conditions via Quasi-Relative Interior in Convex Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608979)