A sequential method for a class of box constrained quadratic programming problems

DOI10.1007/S00186-007-0173-XMaRDI QIDQ2483014zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Quadratic programmingd.c. optimizationOptimal level solutions

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Box Constrained Quadratic Programming with Proportioning and Projections
• Quadratic programming problems with M-matrices and box constraints
• A new algorithm for the general quadratic programming problems with box constraints
• scientific article; zbMATH DE number 1057696
• scientific article; zbMATH DE number 724207

Cites work

• A finite algorithm for a class of nonlinear multiplicative programs
• A finite algorithm for a particular D.C. quadratic programming problem
• An O(n) algorithm for quadratic knapsack problems
• An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program
• An \(O(n^2)\) active set algorithm for solving two related box constrained parametric quadratic programs
• An \(O(n^2)\) active set algorithm for the solution of a parametric quadratic program
• On the continuous quadratic knapsack problem
• The optimal level solutions method

Cited in

(10)

• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
• Underestimation functions for a rank-two partitioning method
• Rank-two programs involving linear fractional functions
• A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
• A barrier function method for the nonconvex quadratic programming problem with box constraints
• Global optimization of a rank-two nonconvex program
• On box constrained concave quadratic optimization
• A unifying approach to solve a class of parametrically-convexifiable problems
• A new polynomially solvable class of quadratic optimization problems with box constraints
• scientific article; zbMATH DE number 3976785 (Why is no real title available?)

This page was built for publication: A sequential method for a class of box constrained quadratic programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483014)