Asymptotic strong duality

DOI10.3934/NACO.2011.1.539MaRDI QIDQ428498zbMATH OpenOpenAlexWikidataFDO

Authors Xiao Qi Yang, R. S. Burachik

Publication date 22 June 2012

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/naco.2011.1.539

zbMATH Keywords

nonconvex programmingaugmented Lagrangiansnonsmooth optimizationnonlinear semidefinite programmingduality schemes

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Numerical methods involving duality (49M29)

Recommendations

• On the Duality Gap in Nonconvex Optimization
• Strong duality in cone constrained nonconvex optimization
• Strong duality for standard convex programs
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
• On the strong concavity of the dual function of an optimization problem

Cited in

(2)

• A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality
• scientific article; zbMATH DE number 4114373 (Why is no real title available?)

This page was built for publication: Asymptotic strong duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428498)