A new algorithm for the general quadratic programming problems with box constraints
From MaRDI portal
Publication:5962186
DOI10.1007/s11075-009-9358-0zbMath1197.65064MaRDI QIDQ5962186
Peng Wang, Lin Ma, Jian-Ling Li
Publication date: 21 September 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9358-0
algorithm; quadratic programming; numerical examples; box constraints; branch-and-bound; Cholesky factorization; lower bound; D. C. decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- Approximation algorithms for indefinite quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- On affine scaling algorithms for nonconvex quadratic programming
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A global optimization approach to a water distribution network design problem
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Introduction to global optimization
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- Global optimization of marginal functions with applications to economic equilibrium.
