Lagrange-type duality in DC programming problems with equivalent DC inequalities
From MaRDI portal
Publication:340375
DOI10.1186/S13660-016-1219-5zbMATH Open1349.90690OpenAlexW2556437702WikidataQ59471566 ScholiaQ59471566MaRDI QIDQ340375FDOQ340375
Authors: 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
Recommendations
- Lagrange-type duality in DC programming
- Lagrange duality in canonical DC programming
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Farkas-type results and duality for DC programs with convex constraints
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Total Lagrange duality for DC infinite optimization problems
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- Optimality conditions and duality for DC programming in locally convex spaces
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
Cites Work
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Title not available (Why is that?)
- On general minimax theorems
- Duality in D. C. programming: The case of several D. C. constraints
- Lagrange-type duality in DC programming
Cited In (2)
This page was built for publication: Lagrange-type duality in DC programming problems with equivalent DC inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340375)
