Lagrange-type duality in DC programming

DOI10.1016/j.jmaa.2014.04.017zbMath1314.90064OpenAlexW2013345981MaRDI QIDQ489076

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

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

Related Items (9)

Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces ⋮ Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ Lagrange-type duality in DC programming problems with equivalent DC inequalities ⋮ Sum-of-squares relaxations in robust DC optimization and feature selection ⋮ DC approach to weakly convex optimization and nonconvex quadratic optimization problems ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ On Lagrange Duality for Several Classes of Nonconvex Optimization Problems ⋮ Split proximal linearized algorithm and convergence theorems for the split DC program ⋮ A forward-backward algorithm for the DC programming in Hilbert spaces

Cites Work

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

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