Convergence properties of nonmonotone spectral projected gradient methods (Q557737): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.cam.2004.10.018 / rank | |||
Property / author | |||
Property / author: Chang-Yu Wang / rank | |||
Property / author | |||
Property / author: Qian Liu / rank | |||
Property / author | |||
Property / author: Yang, Xinmin / rank | |||
Property / author | |||
Property / author: Qian Liu / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Chang-Yu Wang / 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 / 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 | |||
Property / reviewed by | |||
Property / reviewed by: Nada I. Djuranović-Miličić / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cam.2004.10.018 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1969250454 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-Point Step Size Gradient Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A spectral conjugate gradient method for unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inexact spectral projected gradient methods on convex sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak Sharp Minima in Mathematical Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Projected gradient methods for linearly constrained problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the gradient-projection method for solving the nonsymmetric linear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonmonotonic trust region algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the convergence of projected gradient processes to singular critical points / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex programming in Hilbert space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two facts on the convergence of the Cauchy algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A truncated Newton method with non-monotone line search for unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak Sharp Solutions of Variational Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Barzilai and Borwein choice of steplength for the gradient method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Family of projected descent methods for optimization problems with simple bounds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of the gradient projection method for generalized convex minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence properties of projection and contraction methods for variational inequality problems / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.CAM.2004.10.018 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:33, 9 December 2024
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
0 references
0 references
0 references
0 references