Lagrange duality in canonical DC programming
From MaRDI portal
Recommendations
- Lagrange-type duality in DC programming
- Lagrange-type duality in DC programming problems with equivalent DC inequalities
- Stable zero Lagrange duality for DC conic programming
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Total Lagrange duality for DC infinite optimization problems
Cites work
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- DC programming: overview.
- Duality in D. C. programming: The case of several D. C. constraints
- Duality in Reverse Convex Optimization
- Inequality systems and global optimization
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
Cited in
(11)- On modeling and global solutions for d.c. optimization problems by canonical duality theory
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Canonical DC programming problem: Outer approximation methods revisited
- Split proximal linearized algorithm and convergence theorems for the split DC program
- Lagrange-type duality in DC programming problems with equivalent DC inequalities
- Approximate optimality conditions and stopping criteria in canonical DC programming
- scientific article; zbMATH DE number 2100861 (Why is no real title available?)
- Lagrange-type duality in DC programming
- A forward-backward algorithm for the DC programming in Hilbert spaces
- scientific article; zbMATH DE number 5212662 (Why is no real title available?)
- Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces
This page was built for publication: Lagrange duality in canonical DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258474)