Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
The first monograph to present the solution to quadratic programming problems, a topic usually addressed only in journal publications
Offers theoretical and practical results in the field of bound-constrained and equality-constrained optimization
Provides algorithms with the rate of convergence independent of constraints
Develops theoretically supported scalable algorithms for variational inequalities
Comprehensive presentation of working set methods and inexact augmented Lagrangians
Solving optimization problems in complex systems often requires the implementation of advanced mathematical techniques. Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. QP problems arise in fields as diverse as electrical engineering, agricultural planning, and optics. Given its broad applicability, a comprehensive understanding of quadratic programming is a valuable resource in nearly every scientific field.
Optimal Quadratic Programming Algorithms presents recently developed algorithms for solving large QP problems. The presentation focuses on algorithms which are, in a sense optimal, i.e., they can solve important classes of problems at a cost proportional to the number of unknowns. For each algorithm presented, the book details its classical predecessor, describes its drawbacks, introduces modifications that improve its performance, and demonstrates these improvements through numerical experiments.
This self-contained monograph can serve as an introductory text on quadratic programming for graduate students and researchers. Additionally, since the solution of many nonlinear problems can be reduced to the solution of a sequence of QP problems, it can also be used as a convenient introduction to nonlinear programming. The reader is required to have a basic knowledge of calculus in several variables and linear algebra.
I Background.- Linear Algebra.- Optimization.- II Algorithms.- Conjugate Gradients for Unconstrained Minimization.- Equality Constrained Minimization.- Bound Constrained Minimization.- Bound and Equality Constrained Minimization.- III Applications to Variational Inequalities.- Solution of a Coercive Variational Inequality by FETI—DP Method.- Solution of a Semicoercive Variational Inequality by TFETI Method.