Mathematical theory of optimization
combinatorial optimizationconvergence analysis of nonlinear optimization algorithmslocal optimizationnonlinear optimization
Nonlinear elliptic equations (35J60) Fixed-point theorems (47H10) Variational inequalities (49J40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)
This book is very well written and the exposition is remarkably clear. This book is a source of interesting ideas and brilliant techniques in nonlinear optimization. This book contains much material that has not been previously appeared in this format. The examples are provided with motivation. The main emphasis is on the convergence analysis of nonlinear optimization algorithms and their applications to combinatorial optimization. The passage from local to global optimization is very smooth. Historical notes are very informatives. This book will be of interest to graduate students and researchers in applied mathematics engineering computer science and operations research.
- Optimization. Introduction to mathematical theory and methods
- scientific article; zbMATH DE number 3884831
- scientific article; zbMATH DE number 1361462
- Optimization theory and its application
- Optimization -- theory and practice
- Introduction to mathematical optimization
- Mathematical optimization and economic theory
- Concave programming and DH-point
- Nonlinear combinatorial optimization
- Levitin-Polyak well-posedness by perturbations of inverse variational inequalities
- On the sufficient descent property of the Shanno's conjugate gradient method
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- Global convergence and the Powell singular function
- Exactness and algorithm of an objective penalty function
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- Globally optimal solutions of max-min systems
- Localization of minimax points
- Optimization theory and methods. Nonlinear programming
- Computer geometry and encoding the information on a manifold
- scientific article; zbMATH DE number 1737519 (Why is no real title available?)
- scientific article; zbMATH DE number 6829878 (Why is no real title available?)
- Two modified three-term conjugate gradient methods with sufficient descent property
- scientific article; zbMATH DE number 2120969 (Why is no real title available?)
- scientific article; zbMATH DE number 1406849 (Why is no real title available?)
- Conjugate gradient path method without line search technique for derivative-free unconstrained optimization
- Consensus problems in weighted hierarchical graphs
- A modified three-term conjugate gradient method with sufficient descent property
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Consensus analysis in hierarchical networked systems
- Rank-two programs involving linear fractional functions
- Global approximation of local optimality: nonsubmodular optimization
- Saddle points of general augmented Lagrangians for constrained nonconvex optimization
- Optimization: A case for the development of new mathematical concepts
- Second order duality for nondifferentiable minimax programming problems with generalized convexity
- Second-order duality for nondifferentiable minimax programming involving generalized type I functions
- A globally and superlinearly convergent modified SQP-filter method
This page was built for publication: Mathematical theory of optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941763)
