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: Decision Making and Productivity MeasurementDecision Making and Productivity Measurement
by - arXiv
I wrote this book as a self-teaching tool to assist every teacher, student, mathematician or non-mathematician, and to support their understanding of the elementary concepts on assessing the performance of a set of homogenous firms ...
(8800 views)
Book cover: Convex OptimizationConvex Optimization
by - Cambridge University Press
A comprehensive introduction to the subject for students and practitioners in engineering, computer science, mathematics, statistics, finance, etc. The book shows in detail how optimization problems can be solved numerically with great efficiency.
(24833 views)
Book cover: Optimization Algorithms: Methods and ApplicationsOptimization Algorithms: Methods and Applications
by - InTech
This book covers state-of-the-art optimization methods and their applications in wide range especially for researchers and practitioners who wish to improve their knowledge in this field. It covers applications in engineering and various other areas.
(9395 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - 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.
(19153 views)