**An Introduction to Nonlinear Optimization Theory**

by Marius Durea, Radu Strugariu

**Publisher**: De Gruyter Open 2014**ISBN-13**: 9783110426045**Number of pages**: 328

**Description**:

The goal of this book is to present the main ideas and techniques in the field of continuous smooth and nonsmooth optimization. Starting with the case of differentiable data and the classical results on constrained optimization problems, and continuing with the topic of nonsmooth objects involved in optimization theory, the book concentrates on both theoretical and practical aspects of this field.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Discrete Optimization**

by

**Guido Schaefer**-

**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.

(

**7797**views)

**Linear Complementarity, Linear and Nonlinear Programming**

by

**Katta G. Murty**

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.

(

**10385**views)

**Applied Mathematical Programming**

by

**S. Bradley, A. Hax, T. Magnanti**-

**Addison-Wesley**

This book shows you how to model a wide array of problems. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, etc.

(

**17291**views)

**The Design of Approximation Algorithms**

by

**D. P. Williamson, D. B. Shmoys**-

**Cambridge University Press**

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.

(

**14468**views)