Lagrange-type duality in DC programming problems with equivalent DC inequalities

DOI10.1186/s13660-016-1219-5zbMath1349.90690OpenAlexW2556437702WikidataQ59471566 ScholiaQ59471566MaRDI QIDQ340375

Ryohei Harada, Daishi Kuroiwa

Publication date: 14 November 2016

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-016-1219-5

zbMATH Keywords

constraint qualificationDC functionDC programming problemLagrange duality theorem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Duality theory (optimization) (49N15)

Cites Work

• Lagrange-type duality in DC programming
• On general minimax theorems
• Duality in D. C. programming: The case of several D. C. constraints
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
• Unnamed Item

This page was built for publication: Lagrange-type duality in DC programming problems with equivalent DC inequalities