AN ALGORITHM TO MINIMIZE SINGLE VARIABLE POLYNOMIAL, FUNCTIONS FROM ANY STARTING POINT WITH QUADRATIC CONVERGENCE

James Thorne, Doran Greening, Robert E.D. Woolsey

Abstract


Search methods often display non-convergence or excessive convergence time on certain classes of nonlinear functions arising in engineering design. The authors will define a new geometric -programming based search method for single variable polynomials that displays quadratic convergence from any starting point Comparison over a group of test problems is made with a version of Newton's method

Full Text:

PDF


DOI: https://doi.org/10.7166/2-2-444

Refbacks

  • There are currently no refbacks.


Bookmark and Share


Copyright (c) 2015 The South African Journal of Industrial Engineering

ISSN 2224-7890 (on-line) ; ISSN 1012-277X (print)

Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


Disclaimer:
This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help