𝔖 Scriptorium
✦   LIBER   ✦
📁

Conjugate Gradient Algorithms in Nonconvex Optimization

✍ Scribed by Radosław Pytlak (auth.)

Publisher
Springer-Verlag Berlin Heidelberg
Year
2009
Tongue
English
Leaves
492
Series
Nonconvex Optimization and Its Applications 89
Edition
1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

This up-to-date book is on algorithms for large-scale unconstrained and bound constrained optimization. Optimization techniques are shown from a conjugate gradient algorithm perspective.

Large part of the book is devoted to preconditioned conjugate gradient algorithms. In particular memoryless and limited memory quasi-Newton algorithms are presented and numerically compared to standard conjugate gradient algorithms.

The special attention is paid to the methods of shortest residuals developed by the author. Several effective optimization techniques based on these methods are presented.

Because of the emphasis on practical methods, as well as rigorous mathematical treatment of their convergence analysis, the book is aimed at a wide audience. It can be used by researches in optimization, graduate students in operations research, engineering, mathematics and computer science. Practitioners can benefit from numerous numerical comparisons of professional optimization codes discussed in the book.

✦ Table of Contents

Front Matter....Pages i-xxvi
Conjugate Direction Methods for Quadratic Problems....Pages 1-62
Conjugate Gradient Methods for Nonconvex Problems....Pages 63-108
Memoryless Quasi-Newton Methods....Pages 109-131
Preconditioned Conjugate Gradient Algorithms....Pages 134-158
Limited Memory Quasi-Newton Algorithms....Pages 159-190
The Method of Shortest Residuals and Nondifferentiable Optimization....Pages 191-215
The Method of Shortest Residuals for Differentiable Problems....Pages 217-278
The Preconditioned Shortest Residuals Algorithm....Pages 279-297
Optimization on a Polyhedron....Pages 299-325
Conjugate Gradient Algorithms for Problems with Box Constraints....Pages 327-369
Preconditioned Conjugate Gradient Algorithms for Problems with Box Constraints....Pages 371-398
Preconditioned Conjugate Gradient Based Reduced-Hessian Methods....Pages 399-428
Back Matter....Pages 429-477

✦ Subjects

Calculus of Variations and Optimal Control; Optimization; Operations Research/Decision Theory; Quality Control, Reliability, Safety and Risk

📜 SIMILAR VOLUMES

Global Optimization in Action: Continuou
📁 Global Optimization in Action: Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications (Nonconvex Optimization and Its Applications)
✍ Janos D. Pinter 📂 Library 📅 1995 🌐 English

In science, engineering and economics, decision problems are frequently modelled by optimizing the value of a (primary) objective function under stated feasibility constraints. In many cases of practical relevance, the optimization problem structure does not warrant the global optimality of loca

Conjugate Gradient Algorithms and Finite
📁 Conjugate Gradient Algorithms and Finite Element Methods
✍ Alena à olcová (auth.), Prof. Michal Křížek, Prof. Pekka Neittaanmäki, Dr. Serge 📂 Library 📅 2004 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p><P> The position taken in this collection of pedagogically written essays is that conjugate gradient algorithms and finite element methods complement each other extremely well. Via their combinations practitioners have been able to solve differential equations and multidimensional problems modele

Nonlinear Conjugate Gradient Methods for
📁 Nonlinear Conjugate Gradient Methods for Unconstrained Optimization
✍ Neculai Andrei 📂 Library 📅 2020 🏛 Springer 🌐 English

<p></p><p>Two approaches are known for solving <i>large-scale</i> unconstrained optimization problems―the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and converge