This monograph presents a study of interior-point algorithms for the linear complementarity problem, known as a mathematical model for primal-dual pairs of linear programs and convex quadratic programs. A large class of potential reduction algorithms is presented in a unified way.
Read More
This monograph presents a study of interior-point algorithms for the linear complementarity problem, known as a mathematical model for primal-dual pairs of linear programs and convex quadratic programs. A large class of potential reduction algorithms is presented in a unified way.
Read Less
Add this copy of A Unified Approach to Interior Point Algorithms for to cart. $60.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1991 by Springer.
