Min-sup-type zero duality gap properties for DC composite optimization problem
DOI10.1186/S13660-019-2141-4zbMATH Open1499.90267OpenAlexW2960076030MaRDI QIDQ2067945FDOQ2067945
Authors: Liping Tian, D. H. Fang 
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2141-4
Recommendations
- Zero duality gap properties for DC composite optimization problem
- Constraint qualifications and zero duality gap properties in conical programming involving composite functions
- Zero duality gap property for convex composite optimization problems
- Stable zero Lagrange duality for DC conic programming
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Cites Work
- Title not available (Why is that?)
- Variational Analysis and Generalized Differentiation I
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- Farkas-type results and duality for DC programs with convex constraints
- A closedness condition and its applications to DC programs with convex constraints
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Duality in Vector Optimization
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Total Lagrange duality for DC infinite optimization problems
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Zero duality gaps in infinite-dimensional programming
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Local and global optimality conditions for dc infinite optimization problems
- On a zero duality gap result in extended monotropic programming
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Stable zero Lagrange duality for DC conic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Min-sup-type zero duality gap properties for DC composite optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2067945)
