Paper · 1972

Comparison of Several Gradient Algorithms for Mathematical Programming Problems

Miele, A., J. L. Tietze, Levy, A. V.

Defense Technical Information Center (DTIC) · Published 1 June 1972

View at the publisherCite this paper

In brief

“Comparison of Several Gradient Algorithms for Mathematical Programming Problems” is a 1972 paper by Miele, A. and 2 co-authors, published in Defense Technical Information Center (DTIC). OpenAlex counts 10 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
10
Most cited in
2017 (1)
Field-weighted impact
0.36
References
1
Authors
3

Abstract

In the paper, the numerical solution of the basic problem of mathematical programming is considered. This is the problem of minimizing a function f(x) subject to a constraint phi(x) = 0. Here, f is a scalar, x an n- vector, and phi a q-vector, with q<n. Six variations of the sequential gradient-restoration algorithm and the… 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

A., M., Tietze, J. L., & V., L. A. (1972). Comparison of Several Gradient Algorithms for Mathematical Programming Problems. Defense Technical Information Center (DTIC). http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=AD0745958

MLA 9

A., Miele,, et al. “Comparison of Several Gradient Algorithms for Mathematical Programming Problems.” Defense Technical Information Center (DTIC), 1972. http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=AD0745958.

Chicago

A., Miele,, J. L. Tietze, and Levy, A. V. 1972. “Comparison of Several Gradient Algorithms for Mathematical Programming Problems.” Defense Technical Information Center (DTIC). http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=AD0745958.

Harvard

A., M., Tietze, J. L. and V., L. A. (1972) ‘Comparison of Several Gradient Algorithms for Mathematical Programming Problems’, Defense Technical Information Center (DTIC). Available at: http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=AD0745958.

IEEE

M. A., J. L. Tietze, and L. A. V., “Comparison of Several Gradient Algorithms for Mathematical Programming Problems,” Defense Technical Information Center (DTIC), 1972.

BibTeX

@article{a1972comparison,
  title     = {{Comparison of Several Gradient Algorithms for Mathematical Programming Problems}},
  author    = {A., Miele, and Tietze, J. L. and V., Levy, A.},
  journal   = {Defense Technical Information Center (DTIC)},
  year      = {1972},
  url       = {http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=AD0745958}
}

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

Citations by year

YearCitationsShare of the best year
201711
201811
202111

Its field-weighted citation impact is 0.36: it has been cited 0.36 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

  • constrained optimization
  • nonlinear programming
  • sequential gradient-restoration algorithm
  • restoration strategies
  • algorithm efficiency
  • number of iterations
  • equality constraints

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?

A., M., Tietze, J. L., & V., L. A. (1972). Comparison of Several Gradient Algorithms for Mathematical Programming Problems. Defense Technical Information Center (DTIC). http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=AD0745958

How many times has this paper been cited?

10 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?

Miele, A., J. L. Tietze, Levy, A. V..

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.