Gauss-seidel method for least-distance problems
- 1 December 1992
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 75 (3), 487-500
- https://doi.org/10.1007/bf00940488
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The smallest point of a polytopeJournal of Optimization Theory and Applications, 1990
- An algorithm for a singly constrained class of quadratic programs subject to upper and lower boundsMathematical Programming, 1990
- Iterative Methods for Large Convex Quadratic Programs: A SurveySIAM Journal on Control and Optimization, 1987
- A nonlinear equation for linear programmingMathematical Programming, 1986
- ConstrainedL p approximationConstructive Approximation, 1985
- Methods for quadratic programming: A surveyComputers & Chemical Engineering, 1983
- Some continuity properties of polyhedral multifunctionsPublished by Springer Nature ,1981
- Finding the nearest point in A polytopeMathematical Programming, 1976
- Finding the Point of a Polyhedron Closest to the OriginSIAM Journal on Control, 1974
- Algorithm for a least-distance programming problemPublished by Springer Nature ,1974