Smoothing methods for convex inequalities and linear complementarity problems

Mathematical Programming

Volumn 71, Issue 1, 1995, Pages 51-69

  Chen, Chunhui ^a   Mangasarian, O L ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Convex inequalities; Linear complementarity; Smoothing

Indexed keywords

OPTIMIZATION;

COMPLEMENTARITY PROBLEM; INEQUALITY; LINEAR COMPLEMENTARITY PROBLEM; SMOOTHING;

MATHEMATICAL PROGRAMMING;

EID: 0029206129     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01592244     Document Type: Article

References (20)

1. Massively parallel solution of quadratic programs via successive overrelaxation
2. On approximate solutions of systems of linear inequalities
3. A polynomial-time algorithm for a class of linear complementarity problems
4. 1 estimation
5. A condition number for linear inequalities and linear programs
6. A condition number for differentiable convex inequalities
7. Mathematical programming in neural networks
8. Error bounds for inconsistent linear inequalities and programs
9. New improved error bounds for the linear complementarity problem
10. The relaxation method for linear inequalities
11. Newton-type minimization via the Lanczos method
12. On smoothing exact penalty functions for convex constrained optimization
13. Application of error bounds for convex programming in a linear space