Journal article · 1977
Unconstrained Optimization by Approximation of the Gradient Path
Mathematics of Operations Research, 2(3), 253–265 · Published 1 August 1977 · DOI 10.1287/moor.2.3.253
In brief
“Unconstrained Optimization by Approximation of the Gradient Path” is a 1977 journal article by Jean-Philippe Vial and Israël Zang, published in Mathematics of Operations Research. OpenAlex counts 18 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 18
- Most cited in
- 2016 (3)
- Field-weighted impact
- 1.87
- References
- 31
- Authors
- 2
Abstract
A gradient-path oriented algorithm for unconstrained minimization, requiring first derivatives of the objective, is presented. The algorithm possesses the quadratic termination property and it is shown to converge to a stationary point of a continuously differentiable Function. 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
Vial, J.-P., & Zang, I. (1977). Unconstrained Optimization by Approximation of the Gradient Path. Mathematics of Operations Research, 2(3), 253–265. https://doi.org/10.1287/moor.2.3.253
MLA 9
Vial, Jean-Philippe, and Israël Zang. “Unconstrained Optimization by Approximation of the Gradient Path.” Mathematics of Operations Research, vol. 2, no. 3, 1977, pp. 253–265. https://doi.org/10.1287/moor.2.3.253.
Chicago
Vial, Jean-Philippe and Israël Zang. 1977. “Unconstrained Optimization by Approximation of the Gradient Path.” Mathematics of Operations Research 2 (3): 253–265. https://doi.org/10.1287/moor.2.3.253.
Harvard
Vial, J.-P. and Zang, I. (1977) ‘Unconstrained Optimization by Approximation of the Gradient Path’, Mathematics of Operations Research, 2(3), pp. 253–265. doi:10.1287/moor.2.3.253.
IEEE
J.-P. Vial and I. Zang, “Unconstrained Optimization by Approximation of the Gradient Path,” Mathematics of Operations Research, vol. 2, no. 3, pp. 253–265, 1977, doi: 10.1287/moor.2.3.253.
BibTeX
@article{vial1977unconstrained,
title = {{Unconstrained Optimization by Approximation of the Gradient Path}},
author = {Vial, Jean-Philippe and Zang, Israël},
journal = {Mathematics of Operations Research},
year = {1977},
volume = {2},
number = {3},
pages = {253--265},
doi = {10.1287/moor.2.3.253},
url = {https://doi.org/10.1287/moor.2.3.253}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2013 | 2 | |
| 2016 | 3 | |
| 2018 | 1 |
Its field-weighted citation impact is 1.87: it has been cited 1.87 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
- unconstrained optimization
- first-order methods
- stationary point convergence
- continuously differentiable functions
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Vial, J.-P., & Zang, I. (1977). Unconstrained Optimization by Approximation of the Gradient Path. Mathematics of Operations Research, 2(3), 253–265. https://doi.org/10.1287/moor.2.3.253
How many times has this paper been cited?
18 times, according to OpenAlex on 19 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?
Jean-Philippe Vial, Israël Zang.
What is the DOI of this paper?
10.1287/moor.2.3.253, permanently at https://doi.org/10.1287/moor.2.3.253. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.