Gauss-Seidel method for least-distance problems

DOI10.1007/BF00940488zbMath0790.65051OpenAlexW2064449121MaRDI QIDQ1321271

Wu Li, Panos M. Pardalos, Chi-Geun Han

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940488

zbMATH Keywords

quadratic programminglinear convergenceGauss-Seidel methodbounded inequality constraintsleast-distance problemspiecewise linear equationsunconstrained convex minimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)

Related Items

Heuristic approach for minimizing the projection error in the integrated mapping, Piecewise-linear pathways to the optimal solution set in linear programming, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, A dual approach to constrained interpolation from a convex subset of Hilbert space, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Optimal decisions in combining the SOM with nonlinear projection methods, Regularized gap function as penalty term for constrained minimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Solving the minimal least squares problem subject to bounds on the variables
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Constrained \(L_ p\) approximation
• Global error bounds for monotone affine variational inequality problems
• On a global error bound for a class of monotone affine variational inequality problems
• On the convergence of the coordinate descent method for convex differentiable minimization
• Constrained best approximation in Hilbert space
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• A nonlinear equation for linear programming
• Convex quadratic programming with one constraint and bounded variables
• Some continuity properties of polyhedral multifunctions
• Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
• Finding the nearest point in A polytope
• Finding the Point of a Polyhedron Closest to the Origin
• Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem