Total Lagrange duality for DC infinite optimization problems
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- 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
- Constraint qualifications for semi-infinite systems of convex inequalities
- Constructing a perfect duality in infinite programming
- DC programming: overview.
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Duality in D. C. programming: The case of several D. C. constraints
- Duality in nonconvex optimization
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
- Farkas-type results and duality for DC programs with convex constraints
- From linear to convex systems: consistency, Farkas' lemma and applications
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- New Farkas-type constraint qualifications in convex infinite programming
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Qualification and optimality conditions for dc programs with infinite constraints
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
Cited in
(11)- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Optimality conditions and total dualities for conic programming involving composite function
- Lagrange duality in canonical DC programming
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
- 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
- Lagrange-type duality in DC programming
- Lagrange-type duality in DC programming problems with equivalent DC inequalities
- 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)
