Strong duality in optimization: shifted power reformulation
From MaRDI portal
Publication:2829558
DOI10.1080/10556788.2015.1104678zbMATH Open1358.90151DBLPjournals/oms/Xia016OpenAlexW2201555914WikidataQ57445408 ScholiaQ57445408MaRDI QIDQ2829558FDOQ2829558
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
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
- 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)
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)
