A generalized conjugate gradient algorithm for solving a class of quadratic programming problems

DOI10.1016/0024-3795(80)90173-1zbMath0464.65039OpenAlexW1989387477WikidataQ114852111 ScholiaQ114852111MaRDI QIDQ1154218

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(80)90173-1

zbMATH Keywords

linear complementarity problem convergence rate quadratic function scaled conjugate gradient method sparsity techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, Modulus Methods for Nonnegatively Constrained Image Restoration, On the constrained linear least-squares problem: A personal view, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, Iterative schemes for the least 2-norm solution of piecewise linear programs, A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D, A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner, A direct method for sparse least squares problems with lower and upper bounds, Least-norm linear programming solution as an unconstrained minimization problem, Modulus-based synchronous multisplitting iteration methods for linear complementarity problems, Algorithms for bound constrained quadratic programming problems, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Projected gradient methods for linearly constrained problems, A conjugate gradient algorithm for sparse linear inequalities, The bound-constrained conjugate gradient method for non-negative matrices, A row relaxation method for large \(l_ 1\) problems, Unnamed Item, A projected Newton-CG method for nonnegative astronomical image deblurring, Quasi-optimal degree distribution for a quadratic programming problem arising from the \(p\)-version finite element method for a one-dimensional obstacle problem, Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems, Unnamed Item, An iterative method for linear discrete ill-posed problems with box constraints, A differentiable exact penalty function for bound constrained quadratic programming problems, An algorithm for the fast solution of symmetric linear complementarity problems, Elastoplastic torsion by quadratic programming, A numerical algorithm for hydrodynamic free boundary problems, Generalized Conjugate Gradient Methods for ℓ₁ Regularized Convex Quadratic Programming with Finite Convergence, On iterative algorithms for linear least squares problems with bound constraints, Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems, Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables, A priori error estimates forhppenalty BEM for contact problems in elasticity, Solving the minimal least squares problem subject to bounds on the variables, A unified derivation for fast estimation algorithms by the conjugate direction method, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Cites Work