The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Open accessAbstract
Nonmonotone projected gradient techniques are considered for the minimization of differentiable functions on closed convex sets. The classical projected gradient schemes are extended to include a nonmonotone steplength strategy that is based on the Grippo--Lampariello--Lucidi nonmonotone line search. In particular, the nonmonotone strategy is combined with the spectral gradient choice of steplength to accelerate the convergence process. In addition to the classical projected gradient nonlinear path, the feasible spectral projected gradient is used as a search direction to avoid additional trial projections during the one-dimensional search process. Convergence properties and extensive numerical results are presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Two-Point Step Size Gradient Methods
BARZILAI, J., & BORWEIN, J. M. (1988) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/8.1.141 · Cited by 2,873
A Nonmonotone Line Search Technique for Newton’s Method
Grippo, L., Lampariello, F., & Lucidi, S. (1986) · SIAM Journal on Numerical Analysis · doi:10.1137/0723046 · Cited by 1,156
Conn, A. R., Gould, N. I. M., & Toint, P. (1991) · SIAM Journal on Numerical Analysis · doi:10.1137/0728030 · Cited by 873
Constrained minimization methods
Levitin, E. S., & Polyak, B. T. (1966) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(66)90114-5 · Cited by 846
Convex programming in Hilbert space
Goldstein, A. A. (1964) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1964-11178-2 · Cited by 633
Projected gradient methods for linearly constrained problems
Calamai, P. H., & Moré, J. J. (1987) · Mathematical Programming · doi:10.1007/bf02592073 · Cited by 588
On the Goldstein-Levitin-Polyak gradient projection method
Bertsekas, D. P. (1976) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1976.1101194 · Cited by 583
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
Dinh, T. P., & Thi, H. A. L. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623494274313 · Cited by 569
Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · SIAM Journal on Numerical Analysis · doi:10.1137/0725029 · Cited by 317
Cited by
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/090756855 · Cited by 848
Unifying Optimization Algorithms to Aid Software System Users:optimx for R
Nash, J. C., & Varadhan, R. (2011) · Journal of Statistical Software · doi:10.18637/jss.v043.i09 · Cited by 426
Kim, J., He, Y., & Park, H. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0035-4 · Cited by 352
Hypergraph Learning: Methods and Practices
Gao, Y., Zhang, Z., Lin, H., Zhao, X., Du, S., & Zou, C. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3039374 · Cited by 356
Metadata
- Authors
- Birgin, E. G., Martínez, J. M., & Raydan, M.
- Venue
- SIAM Journal on Optimization
- Published
- 2000-01
- Volume
- 10
- Issue
- 4
- Pages
- 1196-1211
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1973734200
- Cited by
- 1,056
- References
- 14
- FWCI
- 12.86
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Nonmonotone Spectral Projected Gradient Methods on Convex Sets. https://app.cochat.ai/papers/10.1137/s1052623497330963
- The paper
- Birgin, E. G., Martínez, J. M., & Raydan, M. (2000). Nonmonotone Spectral Projected Gradient Methods on Convex Sets. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623497330963
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.