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.
(12758 views)
Book cover: Applied Mathematical Programming Using Algebraic SystemsApplied Mathematical Programming Using Algebraic Systems
by - Texas A&M University
This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.
(6493 views)
Book cover: Linear Optimisation and Numerical AnalysisLinear Optimisation and Numerical Analysis
by - University of Aberdeen
The book describes the simplex algorithm and shows how it can be used to solve real problems. It shows how previous results in linear algebra give a framework for understanding the simplex algorithm and describes other optimization algorithms.
(10051 views)
Book cover: Discrete OptimizationDiscrete Optimization
by - 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.
(3986 views)