**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 here:

**Download link**

(multiple PDF files)

## Similar books

**Linear Programming**

by

**Jim Burke**-

**University of Washington**

These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.

(

**1856**views)

**Optimization Algorithms on Matrix Manifolds**

by

**P.-A. Absil, R. Mahony, R. Sepulchre**-

**Princeton University Press**

Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.

(

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

(

**8313**views)

**Iterative Methods for Optimization**

by

**C.T. Kelley**-

**Society for Industrial Mathematics**

This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis.

(

**5054**views)