A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
From MaRDI portal
Publication:1154218
DOI10.1016/0024-3795(80)90173-1zbMath0464.65039WikidataQ114852111 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
linear complementarity problem; convergence rate; quadratic function; scaled conjugate gradient method; sparsity techniques
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Unnamed Item, Least-norm linear programming solution as an unconstrained minimization problem, On iterative algorithms for linear least squares problems with bound constraints, Solving the minimal least squares problem subject to bounds on the variables, A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D, A conjugate gradient algorithm for sparse linear inequalities, A projected Newton-CG method for nonnegative astronomical image deblurring, An algorithm for the fast solution of symmetric linear complementarity problems, A unified derivation for fast estimation algorithms by the conjugate direction method, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, On the constrained linear least-squares problem: A personal view, A direct method for sparse least squares problems with lower and upper bounds, Algorithms for bound constrained quadratic programming problems, A row relaxation method for large \(l_ 1\) problems, Elastoplastic torsion by quadratic programming, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, A numerical algorithm for hydrodynamic free boundary problems, Iterative schemes for the least 2-norm solution of piecewise linear programs, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, An iterative method for linear discrete ill-posed problems with box constraints, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, A differentiable exact penalty function for bound constrained quadratic programming problems, Projected gradient methods for linearly constrained problems, Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Free boundary problems in the theory of fluid flow through porous media: Existence and uniqueness theorems
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- On the solution of large, structured linear complementarity problems: the block partitioned case
- The solution of a quadratic programming problem using fast methods to solve systems of linear equations
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Sur des méthodes d'optimisation par relaxation
- Bimatrix Equilibrium Points and Mathematical Programming
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- On Best Conditioned Matrices
