This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method, to the limited memory BFGS method in the case of the large-scale unconstrained optimization. It is shown that the proposed technique maintains the global convergence property on uniformly convex functions for the limited memory BFGS method. Some numerical results are described to illustrate the important role of the damped technique. Since this technique enforces safely the positive definiteness property of the BFGS update for any value of the steplength, we also consider only the first Wolfe–Powell condition on the steplength. Then, as for the backtracking framework, only one gradient evaluation is performed on each it...
To improve the performance of the L-BFGS method for large scale unconstrained optimization, repeatin...
summary:Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstraine...
In this paper we present two new numerical methods for unconstrained large-scale optimization. These...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
We study the numerical performance of a limited memory quasi-Newton method for large scale optimizat...
AbstractThis paper studies recent modifications of the limited memory BFGS (L-BFGS) method for solvi...
This paper studies recent modications of the limited memory BFGS (L-BFGS) method for solving large s...
In this paper we present two new numerical methods for unconstrained large-scale optimization. These...
Abstract. In this paper we present two new numerical methods for unconstrained large-scale optimizat...
A preconditioned steepest descent (SD) method for solving very large (with dimensions up to 106 ) un...
Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstrained optimi...
summary:Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstraine...
To improve the performance of the L-BFGS method for large scale unconstrained optimization, repeatin...
summary:Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstraine...
In this paper we present two new numerical methods for unconstrained large-scale optimization. These...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
This paper is aimed to extend a certain damped technique, suitable for the Broyden–Fletcher–Goldfarb...
We study the numerical performance of a limited memory quasi-Newton method for large scale optimizat...
AbstractThis paper studies recent modifications of the limited memory BFGS (L-BFGS) method for solvi...
This paper studies recent modications of the limited memory BFGS (L-BFGS) method for solving large s...
In this paper we present two new numerical methods for unconstrained large-scale optimization. These...
Abstract. In this paper we present two new numerical methods for unconstrained large-scale optimizat...
A preconditioned steepest descent (SD) method for solving very large (with dimensions up to 106 ) un...
Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstrained optimi...
summary:Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstraine...
To improve the performance of the L-BFGS method for large scale unconstrained optimization, repeatin...
summary:Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstraine...
In this paper we present two new numerical methods for unconstrained large-scale optimization. These...