Logo

An Introduction to Nonlinear Optimization Theory

Large book cover: An Introduction to Nonlinear Optimization Theory

An Introduction to Nonlinear Optimization Theory
by

Publisher: De Gruyter Open
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.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Applied Mathematical Programming Using Algebraic SystemsApplied Mathematical Programming Using Algebraic Systems
by - Texas A&M University
This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.
(12641 views)
Book cover: Optimization and Dynamical SystemsOptimization and Dynamical Systems
by - Springer
Aimed at mathematics and engineering graduate students and researchers in the areas of optimization, dynamical systems, control systems, signal processing, and linear algebra. The problems solved are those of linear algebra and linear systems theory.
(14451 views)
Book cover: Iterative Methods for OptimizationIterative Methods for Optimization
by - 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.
(11083 views)
Book cover: Linear ProgrammingLinear Programming
by - 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.
(8247 views)