• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

Paperback

Series: Lecture Notes in Computer Science, Book 538

General Mathematics

ISBN10: 3540545093
ISBN13: 9783540545095
Publisher: Springer Nature
Published: Sep 25 1991
Pages: 112
Weight: 0.41
Height: 0.26 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics