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: Optimization Models For Decision MakingOptimization Models For Decision Making
by - Springer
This is a Junior level book on some versatile optimization models for decision making in common use. The aim of this book is to develop skills in mathematical modeling, and in algorithms and computational methods to solve and analyze these models.
(12157 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.
(13237 views)
Book cover: A Practical Guide to Robust OptimizationA Practical Guide to Robust Optimization
by - arXiv
The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice.
(7951 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.
(9771 views)