In this paper, acceptability criteria for the stepsize and global convergence conditions are established for unconstrained minimization methods employing only function values. On the basis of these results, the convergence of an implementable line search algorithm is proved and some global stabilization schemes are described. © 1988 Plenum Publishing Corporation
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
In this paper we develop a general convergence theory for nonmonotone line searches in optimization ...
In this paper, starting from the study of the common elements that some globally convergent direct s...
This paper explores the stability of general line search methods in the sense of Lyapunov, for minim...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
. This paper gives a unifying, abstract generalization of pattern search methods for solving nonline...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
We are concerned with defining new globalization criteria for solution methods of nonlinear equation...
We propose in this paper novel global descent methods for unconstrained global optimization problems...
Abstract. An efficient descent method for unconstrained optimization problems is line search method ...
Global convergence theorems for a class of descent methods for unconstrained optimization problems i...
This paper deals with the solution of smooth unconstrained minimization problems by Newton-type meth...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
Some computable schemes for descent methods without line search are proposed. Convergence properties...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
In this paper we develop a general convergence theory for nonmonotone line searches in optimization ...
In this paper, starting from the study of the common elements that some globally convergent direct s...
This paper explores the stability of general line search methods in the sense of Lyapunov, for minim...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
. This paper gives a unifying, abstract generalization of pattern search methods for solving nonline...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
We are concerned with defining new globalization criteria for solution methods of nonlinear equation...
We propose in this paper novel global descent methods for unconstrained global optimization problems...
Abstract. An efficient descent method for unconstrained optimization problems is line search method ...
Global convergence theorems for a class of descent methods for unconstrained optimization problems i...
This paper deals with the solution of smooth unconstrained minimization problems by Newton-type meth...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
Some computable schemes for descent methods without line search are proposed. Convergence properties...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
In this paper we develop a general convergence theory for nonmonotone line searches in optimization ...