Dissertation · 2000

Algorithms for unconstrained optimization

Lixing Han

OpenCommons at University of Connecticut (University of Connecticut) · Published 1 January 2000

View at the publisherCite this paper

In brief

“Algorithms for unconstrained optimization” is a 2000 dissertation by Lixing Han, published in OpenCommons at University of Connecticut (University of Connecticut). OpenAlex counts 6 citations as of 17 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
6
Most cited in
2013 (1)
References
12
Authors
1

Abstract

We begin by developing a line search method for unconstrained optimization which can be regarded as a combined quasi-Newton and steepest descent method. This method possesses a guaranteed global convergence on general nonconvex objective functions and has similar superlinear convergence properties to the usual quasi-Newton methods. Our numerical results on standard test problems show that… 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

Han, L. (2000). Algorithms for unconstrained optimization. OpenCommons at University of Connecticut (University of Connecticut). https://digitalcommons.lib.uconn.edu/dissertations/AAI9984071

MLA 9

Han, Lixing. “Algorithms for unconstrained optimization.” OpenCommons at University of Connecticut (University of Connecticut), 2000. https://digitalcommons.lib.uconn.edu/dissertations/AAI9984071.

Chicago

Han, Lixing. 2000. “Algorithms for unconstrained optimization.” OpenCommons at University of Connecticut (University of Connecticut). https://digitalcommons.lib.uconn.edu/dissertations/AAI9984071.

Harvard

Han, L. (2000) ‘Algorithms for unconstrained optimization’, OpenCommons at University of Connecticut (University of Connecticut). Available at: https://digitalcommons.lib.uconn.edu/dissertations/AAI9984071.

IEEE

L. Han, “Algorithms for unconstrained optimization,” OpenCommons at University of Connecticut (University of Connecticut), 2000.

BibTeX

@phdthesis{han2000algorithms,
  title     = {{Algorithms for unconstrained optimization}},
  author    = {Han, Lixing},
  year      = {2000},
  url       = {https://digitalcommons.lib.uconn.edu/dissertations/AAI9984071}
}

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

  • unconstrained optimization
  • line search methods
  • quasi-Newton methods
  • gradient descent
  • global convergence
  • non-convex optimization
  • superlinear convergence
  • DFP method

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?

Han, L. (2000). Algorithms for unconstrained optimization. OpenCommons at University of Connecticut (University of Connecticut). https://digitalcommons.lib.uconn.edu/dissertations/AAI9984071

How many times has this paper been cited?

6 times, according to OpenAlex on 17 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?

Lixing Han.

Bibliographic data from OpenAlex (CC0), last checked 17 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.