Strong duality in optimization: shifted power reformulation

DOI10.1080/10556788.2015.1104678zbMATH Open1358.90151DBLPjournals/oms/Xia016OpenAlexW2201555914WikidataQ57445408 ScholiaQ57445408MaRDI QIDQ2829558FDOQ2829558

Duan Li, Yong Xia

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

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

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)

Cites Work

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

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)