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

Authors

  • James Thorne Engineering Department, USA Military Academy Westpoint
  • Doran Greening Department of Mathematics, Colorado School of Mines
  • Robert E.D. Woolsey Department of Mathematics, Colorado School of Mines

DOI:

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

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

Downloads

Download data is not yet available.

Downloads

How to Cite

Thorne, J., Greening, D., & Woolsey, R. E. (2012). AN ALGORITHM TO MINIMIZE SINGLE VARIABLE POLYNOMIAL, FUNCTIONS FROM ANY STARTING POINT WITH QUADRATIC CONVERGENCE. The South African Journal of Industrial Engineering, 2(2). https://doi.org/10.7166/2-2-444

Issue

Vol. 2 No. 2 (1988)

Section

General Articles

License

Authors who publish in the Journal agree to the following terms:
  1. Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.