Strong duality in optimization: shifted power reformulation
From MaRDI portal
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
- pth power Lagrangian method for integer programming
- 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
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- 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 integer programming
- Nonlinear Lagrangian methods in constrained nonlinear optimization.
- Nonlinear Lagrangian theory for nonconvex optimization.
- 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
Cited in
(2)
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)
