The adventures of a simple algorithm
type: Item
instance of: scholarly article
title: The adventures of a simple algorithm
zbMATH Open document ID: 1017.65056
DOI: 10.1016/S0024-3795(01)00600-0
author: Achiya Dax
published in: Linear Algebra and its Applications
publication date: 2003-03-11T00:00:00Z
review text: A row-action method for solving the regularized linear programming problem \[ \text{minimize}\quad {\|{\mathbf x}\|^2\over 2}+ \alpha\cdot{\mathbf c}^T\cdot{\mathbf x}\qquad\text{subject to}\quad {\mathbf A}\cdot{\mathbf x}\geq{\mathbf b} \] is presented and analysed. Some numerical tests are given.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1880046
zbMATH Keywords: algorithm
zbMATH Keywords: row-action method
zbMATH Keywords: regularized linear programming problem
zbMATH Keywords: numerical tests
MaRDI profile type: Publication
cites work: A direct method for sparse least squares problems with lower and upper bounds
cites work: Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: An automatic relaxation method for solving interval linear inequalities
cites work: An iterative row-action method for interval convex programming
cites work: Q4718793
cites work: On Linear Restricted and Interval Least-Squares Problems
cites work: A direct active set algorithm for large sparse quadratic programs with simple bounds
cites work: On the solution of large, structured linear complementarity problems: the block partitioned case
cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
cites work: The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
cites work: A row relaxation method for large \(l_ 1\) problems
cites work: On Row Relaxation Methods for Large Constrained Least Squares Problems
cites work: Classroom Note:An Elementary Proof of Farkas' Lemma
cites work: A proximal point algorithm for minimax problems
cites work: On theory and practice of row relaxation methods.
cites work: Theorems of the alternative and duality
cites work: Q3793938
cites work: Eigenvalues and Condition Numbers of Random Matrices
cites work: The distribution and moments of the smallest eigenvalue of a random matrix of Wishart type
cites work: On the Distribution of a Scaled Condition Number
cites work: Finite termination of the proximal point algorithm
cites work: Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
cites work: On the Convergence of the Proximal Point Algorithm for Convex Minimization
cites work: Augmented Lagrangian algorithms for linear programming
cites work: On the acceleration of Kaczmarz's method for inconsistent linear systems
cites work: A relaxation method for reconstructing objects from noisy X-rays
cites work: Q4171875
cites work: A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
cites work: On the convergence properties of Hildreth's quadratic programming algorithm
cites work: Q5768822
cites work: Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
cites work: Extensions of Hildreth’s Row-Action Method for Quadratic Programming
cites work: Iterative Methods for Large Convex Quadratic Programs: A Survey
cites work: On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
cites work: On the convergence of the coordinate descent method for convex differentiable minimization
cites work: Error bounds and convergence analysis of feasible descent methods: A general approach
cites work: Solution of symmetric linear complementarity problems by iterative methods
cites work: Iterative Solution of Linear Programs
cites work: Sparsity-preserving SOR algorithms for separable quadratic and linear programming
cites work: Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
cites work: Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
cites work: Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
cites work: Nonlinear Perturbation of Linear Programs
cites work: Algorithms for bound constrained quadratic programming problems
cites work: More results on the convergence of iterative methods for the symmetric linear complementarity problem
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Interior proximal point algorithm for linear programs
cites work: Interior Dual Least 2-Norm Algorithm for Linear Programs
cites work: Interior dual proximal point algorithm for linear programs
cites work: Projection method for solving a singular system of linear equations and its applications
cites work: Implementing proximal point methods for linear programming
full work available at URL: s0024-3795(01)00600-0
OpenAlex ID: W1976576957
Recommended article: Q4263945
Recommended article: Q3809926
Recommended article: Algorithmic Adventures
Recommended article: FUN with algorithms
Recommended article: Q4004006
Recommended article: Q4608864