An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- 1 January 1996
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 5 (1) , 49-77
- https://doi.org/10.1007/bf00429751
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple BboundsSIAM Journal on Optimization, 1993
- A Class of penalty functions for optimization problema with bound constraintsOptimization, 1992
- A Unified Approach to Interior Point Algorithms for Linear Complementarity ProblemsPublished by Springer Nature ,1991
- A direct active set algorithm for large sparse quadratic programs with simple boundsMathematical Programming, 1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- Introduction to Parallel and Vector Solution of Linear SystemsPublished by Springer Nature ,1988
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper BoundsIMA Journal of Applied Mathematics, 1974