Strong duality in optimization: shifted power reformulation

DOI10.1080/10556788.2015.1104678zbMath1358.90151OpenAlexW2201555914WikidataQ57445408 ScholiaQ57445408MaRDI QIDQ2829558

Li, Duan, Yong Xia

Publication date: 8 November 2016

Published in: Optimization Methods and 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

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

Related Items (1)

A survey of hidden convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and nonlinear programming.
• Local saddle points and convexification for nonconvex optimization problems
• Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
• Zero duality gap for a class of nonconvex optimization problems
• Local saddle point and a class of convexification methods for nonconvex optimization problems
• Nonlinear integer programming
• Towards strong duality in integer programming
• A Nonlinear Lagrangian Approach to Constrained Optimization Problems
• Convergence properties of augmented Lagrangian methods for constrained global optimization
• Saddle point generation in nonlinear nonconvex optimization
• Multipliers and general Lagrangians
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• \(p\)th power Lagrangian method for integer programming
• Nonlinear Lagrangian theory for nonconvex optimization.
• Extended Lagrange and penalty functions in optimization

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