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: 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.
(4302 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.
(10412 views)
Book cover: Optimal Stopping and ApplicationsOptimal Stopping and Applications
by - UCLA
From the table of contents: Stopping Rule Problems; Finite Horizon Problems; The Existence of Optimal Rules; Applications. Markov Models; Monotone Stopping Rule Problems; Maximizing the Rate of Return; Bandit Problems; Solutions to the Exercises.
(7664 views)
Book cover: Convex Optimization: Algorithms and ComplexityConvex Optimization: Algorithms and Complexity
by - 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.
(1434 views)