Journal article · 1995

Full convergence of the steepest descent method with inexact line searches

Regina Sandra Burachik, L. M. Graña Drummond, Alfredo Noel Iusem, Benar Fux Svaiter

Optimization, 32(2), 137–146 · Published 1 January 1995 · DOI 10.1080/02331939508844042

View at the publisherCite this paper

In brief

“Full convergence of the steepest descent method with inexact line searches” is a 1995 journal article by Regina Sandra Burachik and 3 co-authors, published in Optimization. OpenAlex counts 136 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
136
Most cited in
2021 (10)
Field-weighted impact
3.15
References
10
Authors
4

Abstract

Several finite procedures for determining the step size of the steepest descent method for unconstrained optimization, without performing exact one-dimensional minimizations, have been considered in the literature. The convergence analysis of these methods requires that the objective function have bounded level sets and that its gradient satisfy a Lipschitz condition, in order to establish just… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Burachik, R. S., Drummond, L. M. G., Iusem, A. N., & Svaiter, B. F. (1995). Full convergence of the steepest descent method with inexact line searches. Optimization, 32(2), 137–146. https://doi.org/10.1080/02331939508844042

MLA 9

Burachik, Regina Sandra, et al. “Full convergence of the steepest descent method with inexact line searches.” Optimization, vol. 32, no. 2, 1995, pp. 137–146. https://doi.org/10.1080/02331939508844042.

Chicago

Burachik, Regina Sandra, L. M. Graña Drummond, Alfredo Noel Iusem, and Benar Fux Svaiter. 1995. “Full convergence of the steepest descent method with inexact line searches.” Optimization 32 (2): 137–146. https://doi.org/10.1080/02331939508844042.

Harvard

Burachik, R. S. et al. (1995) ‘Full convergence of the steepest descent method with inexact line searches’, Optimization, 32(2), pp. 137–146. doi:10.1080/02331939508844042.

IEEE

R. S. Burachik, L. M. G. Drummond, A. N. Iusem, and B. F. Svaiter, “Full convergence of the steepest descent method with inexact line searches,” Optimization, vol. 32, no. 2, pp. 137–146, 1995, doi: 10.1080/02331939508844042.

BibTeX

@article{burachik1995full,
  title     = {{Full convergence of the steepest descent method with inexact line searches}},
  author    = {Burachik, Regina Sandra and Drummond, L. M. Graña and Iusem, Alfredo Noel and Svaiter, Benar Fux},
  journal   = {Optimization},
  year      = {1995},
  volume    = {32},
  number    = {2},
  pages     = {137--146},
  doi       = {10.1080/02331939508844042},
  url       = {https://doi.org/10.1080/02331939508844042}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201755
201855
201988
202055
20211010
202255
202311
202477
202555
202644

Its field-weighted citation impact is 3.15: it has been cited 3.15 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • steepest descent method
  • inexact line search
  • unconstrained optimization
  • step size selection
  • global convergence

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Burachik, R. S., Drummond, L. M. G., Iusem, A. N., & Svaiter, B. F. (1995). Full convergence of the steepest descent method with inexact line searches. Optimization, 32(2), 137–146. https://doi.org/10.1080/02331939508844042

How many times has this paper been cited?

136 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Regina Sandra Burachik, L. M. Graña Drummond, Alfredo Noel Iusem, Benar Fux Svaiter.

What is the DOI of this paper?

10.1080/02331939508844042. The permanent link is https://doi.org/10.1080/02331939508844042.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.