Solution to nonconvex quadratic programming with both inequality and box constraints
From MaRDI portal
Publication:833456
DOI10.1007/s11081-008-9062-2zbMath1178.90268OpenAlexW2025688026MaRDI QIDQ833456
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-008-9062-2
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
On two triality results ⋮ On quadratically constrained quadratic optimization problems and canonical duality theory
Cites Work
- Unnamed Item
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Checking local optimality in constrained quadratic programming is NP- hard
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Duality principles in nonconvex systems. Theory, methods and applications
- Panpenalty finite element programming for plastic limit analysis
- Some NP-complete problems in quadratic and nonlinear programming
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
This page was built for publication: Solution to nonconvex quadratic programming with both inequality and box constraints
