Topics
optimizationCultivar (cultivated variety)
In a recent paper, Dennis et al. (SIAM Journal on Optimization 1, pp. 333-357, 1991) introduced a new method for unconstrained optimization based on a curvilinear search and tridiagonal updates of the Hessian approximations. In this work we improve the convergence results of that method, showing that global convergence to points that satisfy the second order necessary conditions for a minimizer can be obtained.11322723
In this paper, acceptability criteria for the stepsize and global convergence conditions are establi...
Global convergence theorems for a class of descent methods for unconstrained optimization problems i...
AbstractIn this paper, we propose some improvements on a new gradient-type method for solving large-...
© 2022 Springer. This is the accepted manuscript version of an article which has been published in f...
We present a new algorithmic framework for solving unconstrained minimization problems that incorpor...
AbstractA new search method is presented for unconstrained optimization. The method requires the eva...
International audienceDirect-search algorithms form one of the main classes of algorithms for smooth...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
In this paper, starting from the study of the common elements that some globally convergent direct s...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
Abstract. We present a new algorithmic framework for solving unconstrained minimization problems tha...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
. This paper presents the convergence analysis for the multidirectional search algorithm, a direct s...
. This paper gives a unifying, abstract generalization of pattern search methods for solving nonline...
In this paper, acceptability criteria for the stepsize and global convergence conditions are establi...
Global convergence theorems for a class of descent methods for unconstrained optimization problems i...
AbstractIn this paper, we propose some improvements on a new gradient-type method for solving large-...
© 2022 Springer. This is the accepted manuscript version of an article which has been published in f...
We present a new algorithmic framework for solving unconstrained minimization problems that incorpor...
AbstractA new search method is presented for unconstrained optimization. The method requires the eva...
International audienceDirect-search algorithms form one of the main classes of algorithms for smooth...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
In this paper, starting from the study of the common elements that some globally convergent direct s...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
Abstract. We present a new algorithmic framework for solving unconstrained minimization problems tha...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
. This paper presents the convergence analysis for the multidirectional search algorithm, a direct s...
. This paper gives a unifying, abstract generalization of pattern search methods for solving nonline...
In this paper, acceptability criteria for the stepsize and global convergence conditions are establi...
Global convergence theorems for a class of descent methods for unconstrained optimization problems i...
AbstractIn this paper, we propose some improvements on a new gradient-type method for solving large-...
Add to ORKG