Name: Nonlinear Programming (en Inglés)
SKU: 67184280
Price: 103.97 USD
Availability: InStock
Author: O. Mangasarian

portada Nonlinear Programming (en Inglés)

Formato

Libro Físico

Editorial

SIAM - Society for Industrial and Applied Mathematics

Autor

O. Mangasarian

Colección

Classics in Applied Mathematics

Año

1995

Idioma

Inglés

N° páginas

235

Encuadernación

Tapa Blanda

Dimensiones

22.8x15.4x1.2 cm

ISBN13

9780898713411

Nonlinear Programming (en Inglés)

O. Mangasarian (Autor) · SIAM - Society for Industrial and Applied Mathematics · Tapa Blanda

Libro Nuevo Importado

Envío: 25 a 32 días háb.

$ 189.04$ 103.97

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 3 unidades

$ 103.97

Llega entre el 30 Sep y el 14 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Nonlinear Programming (en Inglés)"

This reprint of the 1969 book of the same name is a concise, rigorous, yet accessible account of the fundamentals of constrained optimization theory. Many problems arising in diverse fields such as machine learning, medicine, chemical engineering, structural design, and airline scheduling can be reduced to a constrained optimization problem. This book provides readers with the fundamentals needed to study and solve such problems.

This reprint of the 1969 book of the same name is a concise, rigorous, yet accessible account of the fundamentals of constrained optimization theory. Many problems arising in diverse fields such as machine learning, medicine, chemical engineering, structural design, and airline scheduling can be reduced to a constrained optimization problem. This book provides readers with the fundamentals needed to study and solve such problems.

Beginning with a chapter on linear inequalities and theorems of the alternative, basics of convex sets and separation theorems are then derived based on these theorems. This is followed by a chapter on convex functions that includes theorems of the alternative for such functions. These results are used in obtaining the saddlepoint optimality conditions of nonlinear programming without differentiability assumptions. Properties of differentiable convex functions are derived and then used in two key chapters of the book, one on optimality conditions for differentiable nonlinear programs and one on duality in nonlinear programming. Generalizations of convex functions to pseudoconvex and quasiconvex functions are given and then used to obtain generalized optimality conditions and duality results in the presence of nonlinear equality constraints.

The book has four useful self-contained appendices on vectors and matrices, topological properties of n-dimensional real space, continuity and minimization, and differentiable functions.