Optimization. Introduction to mathematical theory and methods

DOI10.1007/978-3-662-58855-0MaRDI QIDQ1738350zbMATH OpenOpenAlexFDO

Publication date 11 April 2019

Published in Masterclass (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-58855-0

direct search linear optimization nonlinear minimization optimality conditions penalty functions semidefinite programs

Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Transportation, logistics and supply chain management (90B06) Linear programming (90C05) Semidefinite programming (90C22) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51) Mathematical programming (90Cxx)

Review text

This textbook is devoted to the theory and methods of optimization in finite-dimensional spaces. The book is divided into four parts. The first part describes methods of linear programming. The authors consider the simplex method and various variants of interior-point methods. Special attention is devoted to applications of linear programming to transport and transshipment problems as well as to usage of linear programming in solving some network problems. The second part of the book contains methods for solving nonlinear optimization problems without constraints. The authors describe one-dimensional search methods for functions depending on one variable and, further, for functions depending on more variables, methods based on the usage of gradients are presented (steepest descent, conjugate gradients, trust region and Newton-Gauss methods). The third part is devoted to the theoretical background of nonlinear optimization for both convex and general problems (separation theorems, optimality conditions, Kuhn-Tucker theorem). The theoretical results of the third part are used in the fourth part, in which the authors explain various approaches to constrained nonlinear optimization problems (methods using projected gradient, penalty or barrier functions, primal-dual methods). Special chapters contain methods of semidefinite programming and direct search for functions with more variables. Convergence of the methods is studied. Special attention is devoted to applications of nonlinear optimization both to continuous problems of other areas of mathematics and to solution some discrete combinatorial problems. For the first edition, see [Optimierung. Berlin: Springer (2004; Zbl 1029.90002)].

Recommendations

Cited in

(42)

This page was built for publication: Optimization. Introduction to mathematical theory and methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1738350)