Total Lagrange duality for DC infinite optimization problems
From MaRDI portal
Publication:401875
DOI10.1186/1687-1812-2013-269zbMATH Open1295.90053OpenAlexW2148365796WikidataQ59301999 ScholiaQ59301999MaRDI QIDQ401875FDOQ401875
Authors: D. H. Fang, Zhe Chen 
Publication date: 27 August 2014
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2013-269
Recommendations
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Lagrange-type duality in DC programming problems with equivalent DC inequalities
- Strong and total Lagrange dualities for quasiconvex programming
- Stable zero Lagrange duality for DC conic programming
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- DC programming: overview.
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Title not available (Why is that?)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Title not available (Why is that?)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Duality in nonconvex optimization
- Duality in D. C. programming: The case of several D. C. constraints
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Farkas-type results and duality for DC programs with convex constraints
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
- Constraint qualifications for semi-infinite systems of convex inequalities
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- New Farkas-type constraint qualifications in convex infinite programming
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Qualification and optimality conditions for dc programs with infinite constraints
- From linear to convex systems: consistency, Farkas' lemma and applications
- Constructing a perfect duality in infinite programming
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
Cited In (11)
- Lagrange duality in canonical DC programming
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
- Lagrange-type duality in DC programming
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Lagrange-type duality in DC programming problems with equivalent DC inequalities
- Optimality conditions and total dualities for conic programming involving composite function
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Min-sup-type zero duality gap properties for DC composite optimization problem
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- Strong and total Lagrange dualities for quasiconvex programming
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
This page was built for publication: Total Lagrange duality for DC infinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401875)
