Smoothing methods for convex inequalities and linear complementarity problems
- 1 November 1995
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 71 (1) , 51-69
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- New improved error bounds for the linear complementarity problemMathematical Programming, 1994
- Error bounds for inconsistent linear inequalities and programsOperations Research Letters, 1994
- Massively parallel solution of quadratic programs via successive overrelaxationConcurrency: Practice and Experience, 1993
- Mathematical Programming in Neural NetworksINFORMS Journal on Computing, 1993
- A Finite Smoothing Algorithm for Linear $l_1 $ EstimationSIAM Journal on Optimization, 1993
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A Condition Number for Differentiable Convex InequalitiesMathematics of Operations Research, 1985
- Newton-Type Minimization via the Lanczos MethodSIAM Journal on Numerical Analysis, 1984
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952