A closedness condition and its applications to DC programs with convex constraints
From MaRDI portal
Publication:3577846
DOI10.1080/02331930801951348zbMath1218.90155OpenAlexW1988833018MaRDI QIDQ3577846
No author found.
Publication date: 26 July 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930801951348
closedness conditionsDC programsFenchel-Lagrange dualityFarkas lemmasclosed-cone constraint qualificationToland-Fenchel-Lagrange duality
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Related Items
The stable duality of DC programs for composite convex functions ⋮ Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ An approach to calmness of linear inequality systems from Farkas lemma ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ The directional subdifferential of the difference of two convex functions ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Duality for minimization of the difference of two \(\Phi_c\)-convex functions ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Stable zero Lagrange duality for DC conic programming ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Revisiting some rules of convex analysis ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ Duality for robust linear infinite programming problems revisited ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Differential stability of convex optimization problems under weaker conditions ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ Functional inequalities and theorems of the alternative involving composite functions ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Min-sup-type zero duality gap properties for DC composite optimization problem ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ A new approach to strong duality for composite vector optimization problems ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
Cites Work
- Liberating the subgradient optimality conditions from constraint qualifications
- Strong duality for generalized convex optimization problems
- Semi-continuous mappings in general topology
- Duality in nonconvex optimization
- Duality in D. C. programming: The case of several D. C. constraints
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Solving an inverse problem for an elliptic equation by d.c. programming
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Inequality systems and global optimization
- DC programming: overview.
- An alternative formulation for a new closed cone constraint qualification
- Necessary and sufficient conditions for stable conjugate duality
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Strong Duality for Semidefinite Programming
- The Concave-Convex Procedure
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Farkas-Type Results With Conjugate Functions
- New Farkas-type constraint qualifications in convex infinite programming
