"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.
Rigler, A. K.
Byers, James K.
Wiebe, Henry Allen
Gillett, Billy E.
Plummer, O. R.
Mathematics and Statistics
Ph. D. in Mathematics
University of Missouri--Rolla
x, 238 pages
© 1975 Roger Ellis Lessman, All rights reserved.
Dissertation - Restricted Access
Library of Congress Subject Headings
Print OCLC #
Electronic OCLC #
Link to Catalog Record
Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.http://laurel.lso.missouri.edu/record=b1067238~S5
Lessman, Roger Ellis, "Mixed nonderivative algorithms for unconstrained optimization" (1975). Doctoral Dissertations. 276.
Share My Dissertation If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.