Min-sup-type zero duality gap properties for DC composite optimization problem

DOI10.1186/S13660-019-2141-4MaRDI QIDQ2067945zbMATH OpenOpenAlexFDO

Authors Liping Tian, D. H. Fang

Publication date 19 January 2022

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13660-019-2141-4

zbMATH Keywords

composite functionconic programmingconstraint qualificationDC functionzero duality gap property

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)

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

Cites work

• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• A closedness condition and its applications to DC programs with convex constraints
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• Constraint qualifications and zero duality gap properties in conical programming involving composite functions
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Duality in Vector Optimization
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
• Farkas-type results and duality for DC programs with convex constraints
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• Local and global optimality conditions for dc infinite optimization problems
• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
• On Zero Duality Gap and the Farkas Lemma for Conic Programming
• On a zero duality gap result in extended monotropic programming
• Stable zero Lagrange duality for DC conic programming
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
• The stable Farkas lemma for composite convex functions in infinite dimensional spaces
• Total Lagrange duality for DC infinite optimization problems
• Variational Analysis and Generalized Differentiation I
• Zero duality gap properties for DC composite optimization problem
• Zero duality gaps in infinite-dimensional programming

Cited in

(3)

• Zero duality gap property for convex composite optimization problems
• Constraint qualifications and zero duality gap properties in conical programming involving composite functions
• Zero duality gap properties for DC composite optimization problem

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)