Lagrange-type duality in DC programming

DOI10.1016/J.JMAA.2014.04.017MaRDI QIDQ489076zbMATH OpenOpenAlexFDO

Authors Ryohei Harada, Daishi Kuroiwa

Publication date 27 January 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.04.017

zbMATH Keywords

DC programming problemLagrange duality theorem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• Lagrange-type duality in DC programming problems with equivalent DC inequalities
• Lagrange duality in canonical DC programming
• Total Lagrange duality for DC infinite optimization problems
• scientific article; zbMATH DE number 970337
• Farkas-type results and duality for DC programs with convex constraints
• scientific article; zbMATH DE number 6508514
• scientific article; zbMATH DE number 2100861
• Optimality conditions and duality for DC programming in locally convex spaces
• Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
• Fenchel-Lagrange duality for DC infinite programs with inequality constraints

Cites work

• DC programming: overview.
• Duality in D. C. programming: The case of several D. C. constraints
• Lagrange duality in canonical DC programming
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities

Cited in

(12)

• Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
• Lagrange duality in canonical DC programming
• Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces
• Sum-of-squares relaxations in robust DC optimization and feature selection
• scientific article; zbMATH DE number 2100861 (Why is no real title available?)
• scientific article; zbMATH DE number 1406022 (Why is no real title available?)
• On Lagrange Duality for Several Classes of Nonconvex Optimization Problems
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
• A forward-backward algorithm for the DC programming in Hilbert spaces
• DC approach to weakly convex optimization and nonconvex quadratic optimization problems
• Split proximal linearized algorithm and convergence theorems for the split DC program
• Lagrange-type duality in DC programming problems with equivalent DC inequalities

This page was built for publication: Lagrange-type duality in DC programming

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