Pages that link to "Item:Q4055386"
From MaRDI portal
The following pages link to Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds (Q4055386):
Displaying 21 items.
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- Solving the minimal least squares problem subject to bounds on the variables (Q797970) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization (Q1131824) (← links)
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems (Q1154218) (← links)
- A class of methods for solving large, convex quadratic programs subject to box constraints (Q1177230) (← links)
- An algorithm for minimizing a differentiable function subject to box constraints and errors (Q1249930) (← links)
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables (Q1259272) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811) (← links)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables (Q1744045) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- (Q3940642) (← links)
- Numerically stable methods for quadratic programming (Q4152038) (← links)
- Iterative methods for linear complementarity problems with upperbounds on primary variables (Q4744082) (← links)
- (Q4744151) (← links)
- An active set method for general linear problem subject to box constraints (Q4888259) (← links)