2014
DOI: 10.1007/s11590-014-0792-0
|View full text |Cite
|
Sign up to set email alerts
|

Convergence analysis for the modified spectral projected subgradient method

Abstract: In a recent paper, the spectral projected subgradient (SPS) method was introduced by Loreto et al. for the minimization of a non-differentiable convex piecewise function, and extensive numerical experimentation showed that this method was very efficient. However, no theoretical convergence was shown. In this paper, a modified version of the spectral projected subgradient (MSPS) is presented. The MSPS is the result of applying to SPS the direction approach used by spectral projected gradient version one (SPG1) … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…which shows that our method is different from the ones that appeared in [15][16][17]. Moreover, our line search allows different choices for the sequence (γ k ) k∈N that controls the non-monotonicity.…”
Section: Subgrad Projection Methods With Non-monotone Line Searchmentioning
confidence: 90%
See 1 more Smart Citation
“…which shows that our method is different from the ones that appeared in [15][16][17]. Moreover, our line search allows different choices for the sequence (γ k ) k∈N that controls the non-monotonicity.…”
Section: Subgrad Projection Methods With Non-monotone Line Searchmentioning
confidence: 90%
“…It is worth to noting that the idea of using general nonmonotone line searches in differentiable optimization, generalizing the non-monotone searches proposed in [10,24], have appeared in [9,22]. A modified version of the subgradient method with the non-monotone line search proposed in [10] was considered in [15][16][17].…”
Section: Subgrad Projection Methods With Non-monotone Line Searchmentioning
confidence: 99%
“…It is worth to noting that the idea of using general non-monotone line searches in differentiable optimization, generalizing the non-monotone searches proposed in [12,27], have appeared in [11,24]. A modified version of the subgradient method with the non-monotone line search proposed in [12] was considered in [17][18][19], see also [14].…”
Section: Subgradient Methods With Non-monotone Line Searchmentioning
confidence: 99%
“…They show that the proposed non-monotone method compares favorably with the classical subgradient method endowed with usual prefixed s tep s izes. I t i s worth m entioning t hat o ther modified versions of the subgradient method with non-monotonic linear search proposed in [12] were considered in [17][18][19], see also [14].…”
Section: Introductionmentioning
confidence: 99%
“…To accelerate the convergence of ( 7), reference [18] indicated that Barzilai and Borwein Gradient method [19], [20] can be used for the updating of parameter τ in the k-th iteration…”
Section: Imaging Algorithm and Ect System A Brief Introduction Of Com...mentioning
confidence: 99%