Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
From MaRDI portal
Publication:2338781
DOI10.1016/j.jmaa.2014.01.033zbMath1312.49047OpenAlexW2064880458MaRDI QIDQ2338781
Publication date: 27 March 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2014.01.033
regularity conditionsconic programmingDC infinite programmingFarkas-type resultsFenchel-Lagrange duality
Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (16)
A comparison of alternative c-conjugate dual problems in infinite convex optimization ⋮ Constraint qualifications in convex vector semi-infinite optimization ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty ⋮ Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems ⋮ Generalized polyhedral convex optimization problems ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Semi-infinite programming
- Some new Farkas-type results for inequality systems with DC functions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Conjugate duality in convex optimization
- Duality in nonconvex optimization
- Duality in D. C. programming: The case of several D. C. constraints
- Optimization. Algorithms and consistent approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Inequality systems and global optimization
- Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- DC programming: overview.
- Farkas-type results for fractional programming problems
- A new efficient algorithm based on DC programming and DCA for clustering
- Qualification and optimality conditions for dc programs with infinite constraints
- On strong and total Lagrange duality for convex optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- A closedness condition and its applications to DC programs with convex constraints
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Farkas-Type Results With Conjugate Functions
- New Farkas-type constraint qualifications in convex infinite programming
- Convex analysis and global optimization
This page was built for publication: Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
