Convergence properties of nonmonotone spectral projected gradient methods (Q557737): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Qian Liu / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Yang, Xinmin / rank | |||
Normal rank | |||
Property / review text | |||
In a recent paper, a nonmonotone spectral projected gradient (SPG) method was introduced by \textit{E. G. Birgin} et al. [SIAM J. Optim. 10, No. 4, 1196--1211 (2000; Zbl 1047.90077)] for the minimization of differentiable functions on closed convex sets and extensive presented results showed that this method was very efficient. In this paper, the authors study the convergence properties of SPG methods. They remove various boundedness conditions that are assumed in existing results, such as boundedness from below of the objective function \(f\), boundedness of the sequence of iterates generated by this method or existence of accumulation point of that sequence. If the gradient of \(f\) is uniformly continuous, the convergence theory of this method is established and it is proved that the SPG method forces the sequence of projected gradients to zero. Moreover, under appropriate conditions it is shown that the SPG method has some encouraging convergence properties, such as the global convergence of the sequence of iterates generated by this method and the finite termination, which improve and generalize the corresponding results in previous papers. | |||
Property / review text: In a recent paper, a nonmonotone spectral projected gradient (SPG) method was introduced by \textit{E. G. Birgin} et al. [SIAM J. Optim. 10, No. 4, 1196--1211 (2000; Zbl 1047.90077)] for the minimization of differentiable functions on closed convex sets and extensive presented results showed that this method was very efficient. In this paper, the authors study the convergence properties of SPG methods. They remove various boundedness conditions that are assumed in existing results, such as boundedness from below of the objective function \(f\), boundedness of the sequence of iterates generated by this method or existence of accumulation point of that sequence. If the gradient of \(f\) is uniformly continuous, the convergence theory of this method is established and it is proved that the SPG method forces the sequence of projected gradients to zero. Moreover, under appropriate conditions it is shown that the SPG method has some encouraging convergence properties, such as the global convergence of the sequence of iterates generated by this method and the finite termination, which improve and generalize the corresponding results in previous papers. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Nada I. Djuranović-Miličić / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C52 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 2184004 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonmonotone linear search | |||
Property / zbMATH Keywords: nonmonotone linear search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convergence | |||
Property / zbMATH Keywords: convergence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite termination | |||
Property / zbMATH Keywords: finite termination / rank | |||
Normal rank |
Revision as of 14:08, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convergence properties of nonmonotone spectral projected gradient methods |
scientific article |
Statements
Convergence properties of nonmonotone spectral projected gradient methods (English)
0 references
30 June 2005
0 references
In a recent paper, a nonmonotone spectral projected gradient (SPG) method was introduced by \textit{E. G. Birgin} et al. [SIAM J. Optim. 10, No. 4, 1196--1211 (2000; Zbl 1047.90077)] for the minimization of differentiable functions on closed convex sets and extensive presented results showed that this method was very efficient. In this paper, the authors study the convergence properties of SPG methods. They remove various boundedness conditions that are assumed in existing results, such as boundedness from below of the objective function \(f\), boundedness of the sequence of iterates generated by this method or existence of accumulation point of that sequence. If the gradient of \(f\) is uniformly continuous, the convergence theory of this method is established and it is proved that the SPG method forces the sequence of projected gradients to zero. Moreover, under appropriate conditions it is shown that the SPG method has some encouraging convergence properties, such as the global convergence of the sequence of iterates generated by this method and the finite termination, which improve and generalize the corresponding results in previous papers.
0 references
nonmonotone linear search
0 references
convergence
0 references
finite termination
0 references