The inexact quasi-Newton methods are very attractive methods for large scale optimization since they require only an approximate solution of the linear system of equations for each iteration. To achieve global convergence results, we adjust the step using a backtracking strategy. We discuss the backtracking strategy in detail and show that this strategy has similar convergence properties as one obtains by using line searches with the Goldstein-Armijo conditions. The combination of backtracking and inexact quasi-Newton methods is particularly attractive since the conditions for convergence are easily met. We give conditions for Q-linear and Q-superlinear convergence
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained...
Abstract. Inexact Newton methods for finding a zero of F 1 1 are variations of Newton’s method in wh...
In this paper, we study greedy variants of quasi-Newton methods. They are based on the updating foru...
A class of damped quasi-Newton methods for nonlinear optimization has recently been proposed by exte...
In optimization in Rn with m nonlinear equality constraints, we study the local convergence of reduc...
AbstractQuasi-Newton method is a well-known effective method for solving optimization problems. Sinc...
Quasi-Newton methods are very popular in Optimization. They have a long, rich history, and perform e...
In this thesis we study the local convergence of quasi-Newton methods for nonlinear optimization pro...
Abstract This paper analyzes local convergence rates of primal-dual interior point methods for gener...
AbstractWe develop and analyze an affine scaling inexact generalized Newton algorithm in association...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
In optimization in R^n with m nonlinear equality constraints, we study the local convergence of redu...
The method of quasilinearization for the solution of nonlinear two point boundary value problems is ...
AbstractPractical quasi-Newton methods for solving nonlinear systems are surveyed. The definition of...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained...
Abstract. Inexact Newton methods for finding a zero of F 1 1 are variations of Newton’s method in wh...
In this paper, we study greedy variants of quasi-Newton methods. They are based on the updating foru...
A class of damped quasi-Newton methods for nonlinear optimization has recently been proposed by exte...
In optimization in Rn with m nonlinear equality constraints, we study the local convergence of reduc...
AbstractQuasi-Newton method is a well-known effective method for solving optimization problems. Sinc...
Quasi-Newton methods are very popular in Optimization. They have a long, rich history, and perform e...
In this thesis we study the local convergence of quasi-Newton methods for nonlinear optimization pro...
Abstract This paper analyzes local convergence rates of primal-dual interior point methods for gener...
AbstractWe develop and analyze an affine scaling inexact generalized Newton algorithm in association...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
In optimization in R^n with m nonlinear equality constraints, we study the local convergence of redu...
The method of quasilinearization for the solution of nonlinear two point boundary value problems is ...
AbstractPractical quasi-Newton methods for solving nonlinear systems are surveyed. The definition of...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained...
Abstract. Inexact Newton methods for finding a zero of F 1 1 are variations of Newton’s method in wh...
In this paper, we study greedy variants of quasi-Newton methods. They are based on the updating foru...