Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
From MaRDI portal
Publication:4055386
DOI10.1093/imamat/14.2.159zbMath0301.90032OpenAlexW1975326300MaRDI QIDQ4055386
Publication date: 1974
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/14.2.159
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization, A generalized conjugate gradient algorithm for solving a class of quadratic programming problems, Unnamed Item, An active set method for general linear problem subject to box constraints, A class of methods for solving large, convex quadratic programs subject to box constraints, Unnamed Item, An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables, Equivalence of some quadratic programming algorithms, Numerically stable methods for quadratic programming, A direct active set algorithm for large sparse quadratic programs with simple bounds, An algorithm for minimizing a differentiable function subject to box constraints and errors, The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables, A hybrid algorithm for solving linear inequalities in a least squares sense, A practical anti-cycling procedure for linearly constrained optimization, Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables, Iterative methods for linear complementarity problems with upperbounds on primary variables, Solving the minimal least squares problem subject to bounds on the variables, The adventures of a simple algorithm, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
