Mixed nonderivative algorithms for unconstrained optimization

Author

Roger Ellis Lessman

Abstract

"A general technique is developed to restart nonderivative algorithms in unconstrained optimization. Application of the technique is shown to result in mixed algorithms which are considerably more robust than their component procedures. A general mixed algorithm is developed and its convergence is demonstrated. A uniform computational comparison is given for the new mixed algorithms and for a collection of procedures from the literature"--Abstract, page ii.

Advisor(s)

Rigler, A. K.

Committee Member(s)

Byers, James K.
Wiebe, Henry Allen
Gillett, Billy E.
Plummer, O. R.

Department(s)

Mathematics and Statistics

Degree Name

Ph. D. in Mathematics

Publisher

University of Missouri--Rolla

Publication Date

1975

Pagination

x, 238 pages

Note about bibliography

Includes bibliographical references (pages 182-190).

Rights

© 1975 Roger Ellis Lessman, All rights reserved.

Document Type

Dissertation - Open Access

File Type

text

Language

English

Subject Headings

Mathematical optimization
Approximation theory
Numerical analysis

Thesis Number

T 3044

Print OCLC #

6013383

Electronic OCLC #

913223068

Link to Catalog Record

http://merlin.lib.umsystem.edu/record=b1067238~S5

Recommended Citation

Lessman, Roger Ellis, "Mixed nonderivative algorithms for unconstrained optimization" (1975). Doctoral Dissertations. 276.
https://scholarsmine.mst.edu/doctoral_dissertations/276