**Linear Complementarity, Linear and Nonlinear Programming**

by Katta G. Murty

1997**Number of pages**: 613

**Description**:

This book provides an in-depth and clear treatment of all the important practical, technical, computational, geometric, and mathematical aspects of the Linear Complementarity Problem, Quadratic Programming, and their various applications. It discusses clearly the various algorithms for solving the LCP, presents their efficient implementation for the computer, and discusses their computational complexity. It presents the practical applications of these algorithms and extensions of these algorithms to solve general nonlinear programming problems.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Convex Optimization: Algorithms and Complexity**

by

**Sebastien Bubeck**-

**arXiv.org**

This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.

(

**1153**views)

**Robust Optimization**

by

**A. Ben-Tal, L. El Ghaoui, A. Nemirovski**-

**Princeton University Press**

Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of this relatively new approach to optimization.

(

**5348**views)

**Applied Mathematical Programming**

by

**S. Bradley, A. Hax, T. Magnanti**-

**Addison-Wesley**

This book shows you how to model a wide array of problems. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, etc.

(

**9995**views)

**Discrete Optimization**

by

**Guido Schaefer**-

**Utrecht University**

From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.

(

**4119**views)