First comprehensive reference on trust-region methods, a class of numerical algorithms for the solution of nonlinear convex optimization methods.

The Sharpest Cut is written in honor of Manfred Padberg, who has made fundamental contributions to both the theoretical and computational sides of integer programming and combinatorial optimization. This outstanding collection presents recent results in these areas that are closely connected to Padberg's research. His deep commitment to the geometrical approach to combinatorial optimization can be felt throughout this volume; his search for increasingly better and computationally efficient cutting planes gave rise to its title. The peer-reviewed papers contained here are based on invited...

Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems,

Takes the reader who knows little of interior-point methods to within sight of the research frontier.

This textbook provides a self-contained introduction to linear programming using MATLAB(r) software to elucidate the development of algorithms and theory. Early chapters cover linear algebra basics, the simplex method, duality, the solving of large linear problems, sensitivity analysis, and parametric linear programming. In later chapters, the authors discuss quadratic programming, linear complementarity, interior-point methods, and selected applications of linear programming to approximation and classification problems. Exercises are interwoven with the theory presented in each chapter, and...