Conference paper · 1977

A scheme for determining stepsizes for unconstrained optimization methods

Hiroaki Mukai

IEEE Conference on Decision and Control (CDC), 385–392 · Published 1 December 1977 · DOI 10.1109/cdc.1977.271600

View at the publisherCite this paper

In brief

“A scheme for determining stepsizes for unconstrained optimization methods” is a 1977 conference paper by Hiroaki Mukai, published in IEEE Conference on Decision and Control (CDC). OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
Authors
1

Abstract

We present a new scheme for determining stepsizes for iterative unconstrained minimization methods. This scheme provides a stepsize estimate for the efficient Armijo-type stepsize determination rule and improves its performance. As examples for the new scheme, we also present a new gradient algorithm and a new conjugate gradient algorithm. These two algorithms are readily implementable… 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

Mukai, H. (1977). A scheme for determining stepsizes for unconstrained optimization methods. IEEE Conference on Decision and Control (CDC), 385–392. https://doi.org/10.1109/cdc.1977.271600

MLA 9

Mukai, Hiroaki. “A scheme for determining stepsizes for unconstrained optimization methods.” IEEE Conference on Decision and Control (CDC), 1977, pp. 385–392. https://doi.org/10.1109/cdc.1977.271600.

Chicago

Mukai, Hiroaki. 1977. “A scheme for determining stepsizes for unconstrained optimization methods.” IEEE Conference on Decision and Control (CDC): 385–392. https://doi.org/10.1109/cdc.1977.271600.

Harvard

Mukai, H. (1977) ‘A scheme for determining stepsizes for unconstrained optimization methods’, IEEE Conference on Decision and Control (CDC), pp. 385–392. doi:10.1109/cdc.1977.271600.

IEEE

H. Mukai, “A scheme for determining stepsizes for unconstrained optimization methods,” IEEE Conference on Decision and Control (CDC), pp. 385–392, 1977, doi: 10.1109/cdc.1977.271600.

BibTeX

@inproceedings{mukai1977scheme,
  title     = {{A scheme for determining stepsizes for unconstrained optimization methods}},
  author    = {Mukai, Hiroaki},
  booktitle = {IEEE Conference on Decision and Control (CDC)},
  year      = {1977},
  pages     = {385--392},
  doi       = {10.1109/cdc.1977.271600},
  url       = {https://doi.org/10.1109/cdc.1977.271600}
}

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

Topic and keywords

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

  • step size selection
  • unconstrained optimization
  • gradient algorithm
  • conjugate gradient method
  • global convergence
  • non-convex optimization
  • convergence ratio
  • superlinear 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?

Mukai, H. (1977). A scheme for determining stepsizes for unconstrained optimization methods. IEEE Conference on Decision and Control (CDC), 385–392. https://doi.org/10.1109/cdc.1977.271600

How many times has this paper been cited?

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

Hiroaki Mukai.

What is the DOI of this paper?

10.1109/cdc.1977.271600, permanently at https://doi.org/10.1109/cdc.1977.271600. 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.