Deformable medical image registration: A survey
Deformable image registration is a fundamental task in medical image processing. Among
its most important applications, one may cite: 1) multi-modality fusion, where information …
its most important applications, one may cite: 1) multi-modality fusion, where information …
[PDF][PDF] A survey of nonlinear conjugate gradient methods
A SURVEY OF NONLINEAR CONJUGATE GRADIENT METHODS ∗ 1. Introduction.
Conjugate gradient (CG) methods comprise a class of uncon- Page 1 A SURVEY OF …
Conjugate gradient (CG) methods comprise a class of uncon- Page 1 A SURVEY OF …
[LIBRO][B] Numerical methods for unconstrained optimization and nonlinear equations
JE Dennis Jr, RB Schnabel - 1996 - SIAM
We are delighted that SIAM is republishing our original 1983 book after what many in the
optimization field have regarded as “premature termination” by the previous publisher. At 12 …
optimization field have regarded as “premature termination” by the previous publisher. At 12 …
[LIBRO][B] Numerical optimization
One of the most effective methods for nonlinearly constrained optimization generates steps
by solving quadratic subproblems. This sequential quadratic programming (SQP) approach …
by solving quadratic subproblems. This sequential quadratic programming (SQP) approach …
[LIBRO][B] Iterative methods for optimization
CT Kelley - 1999 - SIAM
This book on unconstrained and bound constrained optimization can be used as a tutorial
for self-study or a reference by those who solve such problems in their work. It can also …
for self-study or a reference by those who solve such problems in their work. It can also …
[LIBRO][B] Nonlinear conjugate gradient methods for unconstrained optimization
N Andrei - 2020 - Springer
This book is on conjugate gradient methods for unconstrained optimization. The concept of
conjugacy was introduced by Magnus Hestenes and Garrett Birkhoff in 1936 in the context of …
conjugacy was introduced by Magnus Hestenes and Garrett Birkhoff in 1936 in the context of …
[LIBRO][B] Linear and Nonlinear Optimization 2nd Edition
An n-dimensional vector x is an array of n scalars x1, x2,..., xn. The notation x represents the
array when its elements are arranged in a column, while the notation xT represents the array …
array when its elements are arranged in a column, while the notation xT represents the array …
Nonsmooth optimization via quasi-Newton methods
We investigate the behavior of quasi-Newton algorithms applied to minimize a nonsmooth
function f, not necessarily convex. We introduce an inexact line search that generates a …
function f, not necessarily convex. We introduce an inexact line search that generates a …
Line search algorithms with guaranteed sufficient decrease
JJ Moré, DJ Thuente - ACM Transactions on Mathematical Software …, 1994 - dl.acm.org
The development of software for minimization problems is often based on a line search
method. We consider line search methods that satisfy sufficient decrease and curvature …
method. We consider line search methods that satisfy sufficient decrease and curvature …
Some numerical experiments with variable-storage quasi-Newton algorithms
JC Gilbert, C Lemaréchal - Mathematical programming, 1989 - Springer
This paper describes some numerical experiments with variable-storage quasi-Newton
methods for the optimization of some large-scale models (coming from fluid mechanics and …
methods for the optimization of some large-scale models (coming from fluid mechanics and …