Pages that link to "Item:Q1154218"
From MaRDI portal
The following pages link to A generalized conjugate gradient algorithm for solving a class of quadratic programming problems (Q1154218):
Displayed 25 items.
- Least-norm linear programming solution as an unconstrained minimization problem (Q593978) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- Solving the minimal least squares problem subject to bounds on the variables (Q797970) (← links)
- A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D (Q861656) (← links)
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- A projected Newton-CG method for nonnegative astronomical image deblurring (Q937181) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- A unified derivation for fast estimation algorithms by the conjugate direction method (Q1067758) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- On the constrained linear least-squares problem: A personal view (Q1099928) (← links)
- A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- A row relaxation method for large \(l_ 1\) problems (Q1176532) (← links)
- Elastoplastic torsion by quadratic programming (Q1251925) (← 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)
- A numerical algorithm for hydrodynamic free boundary problems (Q1802296) (← links)
- Iterative schemes for the least 2-norm solution of piecewise linear programs (Q1902107) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- An iterative method for linear discrete ill-posed problems with box constraints (Q2508957) (← links)
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems (Q2638951) (← links)
- A differentiable exact penalty function for bound constrained quadratic programming problems (Q3362090) (← links)
- Projected gradient methods for linearly constrained problems (Q3773706) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- (Q4508860) (← links)