The adventures of a simple algorithm
From MaRDI portal
Publication:1863543
DOI10.1016/S0024-3795(01)00600-0zbMath1017.65056OpenAlexW1976576957MaRDI QIDQ1863543
Publication date: 11 March 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(01)00600-0
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05)
Related Items
Kaczmarz's anomaly: a surprising feature of Kaczmarz's method ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- On the convergence properties of Hildreth's quadratic programming algorithm
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- An automatic relaxation method for solving interval linear inequalities
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- A direct method for sparse least squares problems with lower and upper bounds
- Algorithms for bound constrained quadratic programming problems
- Implementing proximal point methods for linear programming
- An iterative row-action method for interval convex programming
- A row relaxation method for large \(l_ 1\) problems
- Finite termination of the proximal point algorithm
- The distribution and moments of the smallest eigenvalue of a random matrix of Wishart type
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Solution of symmetric linear complementarity problems by iterative methods
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the convergence of the coordinate descent method for convex differentiable minimization
- Interior proximal point algorithm for linear programs
- Augmented Lagrangian algorithms for linear programming
- Interior dual proximal point algorithm for linear programs
- Theorems of the alternative and duality
- A proximal point algorithm for minimax problems
- Projection method for solving a singular system of linear equations and its applications
- The multiplier method of Hestenes and Powell applied to convex programming
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Interior Dual Least 2-Norm Algorithm for Linear Programs
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- On Linear Restricted and Interval Least-Squares Problems
- Eigenvalues and Condition Numbers of Random Matrices
- Nonlinear Perturbation of Linear Programs
- A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Iterative Solution of Linear Programs
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Distribution of a Scaled Condition Number
- A relaxation method for reconstructing objects from noisy X-rays
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Classroom Note:An Elementary Proof of Farkas' Lemma
- On Row Relaxation Methods for Large Constrained Least Squares Problems
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
