Study on the Lagrange dualities for composite optimization problems with conical constraints
From MaRDI portal
Recommendations
- Lagrange dualities for robust composite optimization problems
- Study on the Fenchel dualities for composite optimization problems
- Constraint qualifications and zero duality gap properties in conical programming involving composite functions
- The strong duality for DC optimization problems with composite convex functions
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
Cited in
(10)- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Strong and total Lagrange dualities for quasiconvex programming
- New constraint qualification and conjugate duality for composed convex optimization problems
- Study on the Fenchel dualities for composite optimization problems
- scientific article; zbMATH DE number 7448122 (Why is no real title available?)
- Constraint qualifications and zero duality gap properties in conical programming involving composite functions
- Lagrange dualities for robust composite optimization problems
- Optimality conditions for composite optimization problems with conical constraints
- Duality for composite optimization problem within the framework of abstract convexity
- New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems
This page was built for publication: Study on the Lagrange dualities for composite optimization problems with conical constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132161)
