Logo

Linear Complementarity, Linear and Nonlinear Programming

Small book cover: Linear Complementarity, Linear and Nonlinear Programming

Linear Complementarity, Linear and Nonlinear Programming
by


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.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Convex OptimizationConvex Optimization
by - Cambridge University Press
A comprehensive introduction to the subject for students and practitioners in engineering, computer science, mathematics, statistics, finance, etc. The book shows in detail how optimization problems can be solved numerically with great efficiency.
(24843 views)
Book cover: An Introduction to Nonlinear Optimization TheoryAn Introduction to Nonlinear Optimization Theory
by - De Gruyter Open
Starting with the case of differentiable data and the classical results on constrained optimization problems, continuing with the topic of nonsmooth objects involved in optimization, the book concentrates on both theoretical and practical aspects.
(9641 views)
Book cover: Universal Optimization and Its ApplicationUniversal Optimization and Its Application
by - viXra.org
This book describes new method of optimization (''Method of Deformation of Functional'') that has the advantages at greater generality and flexibility as well as the ability to solve complex problems which other methods cannot solve.
(7816 views)
Book cover: Linear ProgrammingLinear Programming
by - University of Washington
These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.
(10240 views)