Strong duality in optimization: shifted power reformulation

DOI10.1080/10556788.2015.1104678MaRDI QIDQ2829558zbMATHOpenAlexDBLPWikidataFDO

Authors Yong Xia, Duan Li

Publication date 8 November 2016

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2015.1104678

zbMATH Keywords

nonconvex optimizationstrong duality\(p\)th power methodshifted power reformulation

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Integer programming (90C10)

Recommendations

• Zero duality gap for a class of nonconvex optimization problems
• Towards strong duality in integer programming
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
• Strong duality in cone constrained nonconvex optimization
• On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization

Cites work

• scientific article; zbMATH DE number 193499 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A nonlinear Lagrangian approach to constrained optimization problems
• Convergence properties of augmented Lagrangian methods for constrained global optimization
• Extended Lagrange and penalty functions in optimization
• Linear and nonlinear programming.
• Local saddle point and a class of convexification methods for nonconvex optimization problems
• Local saddle points and convexification for nonconvex optimization problems
• Multipliers and general Lagrangians
• Nonlinear Lagrangian methods in constrained nonlinear optimization.
• Nonlinear Lagrangian theory for nonconvex optimization.
• Nonlinear integer programming
• Saddle point generation in nonlinear nonconvex optimization
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• Towards strong duality in integer programming
• Zero duality gap for a class of nonconvex optimization problems
• Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
• \(p\)th power Lagrangian method for integer programming

Cited in

(2)

• Zero duality gap for a class of nonconvex optimization problems
• A survey of hidden convex optimization

This page was built for publication: Strong duality in optimization: shifted power reformulation

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