A sequential method for a class of box constrained quadratic programming problems
From MaRDI portal
Publication:2483014
DOI10.1007/s00186-007-0173-xzbMath1165.90015OpenAlexW1991519878MaRDI QIDQ2483014
Riccardo Cambini, Claudio Sodini
Publication date: 5 May 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-007-0173-x
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)
Related Items (4)
Global optimization of a rank-two nonconvex program ⋮ A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs ⋮ Underestimation functions for a rank-two partitioning method ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
Cites Work
- An O(n) algorithm for quadratic knapsack problems
- On the continuous quadratic knapsack problem
- An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program
- A finite algorithm for a class of nonlinear multiplicative programs
- A finite algorithm for a particular D.C. quadratic programming problem
- An \(O(n^2)\) active set algorithm for the solution of a parametric quadratic program
- The optimal level solutions method
- An \(O(n^2)\) active set algorithm for solving two related box constrained parametric quadratic programs
This page was built for publication: A sequential method for a class of box constrained quadratic programming problems
