AN ALGORITHM TO MINIMIZE SINGLE VARIABLE POLYNOMIAL, FUNCTIONS FROM ANY STARTING POINT WITH QUADRATIC CONVERGENCE
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 st...
Main Authors: | James Thorne, Doran Greening, Robert E.D. Woolsey |
---|---|
Format: | Article |
Language: | English |
Published: |
Stellenbosch University
2012-01-01
|
Series: | South African Journal of Industrial Engineering |
Online Access: | http://sajie.journals.ac.za/pub/article/view/444 |
Similar Items
-
Further irreducibility criteria for polynomials associated with the complete residue systems in any imaginary quadratic field
by: Phitthayathon Phetnun, et al.
Published: (2022-08-01) -
Cycles of quadratic polynomials and rational points on a genus 2 curve
by: Flynn, E, et al.
Published: (1997) -
Cycles of Quadratic Polynomials and Rational Points on a Genus-Two Curve
by: Flynn, E, et al.
Published: (1995) -
A Class of Quadratic Polynomial Chaotic Maps and Their Fixed Points Analysis
by: Chuanfu Wang, et al.
Published: (2019-07-01) -
A simple polynomial-time algorithm for convex quadratic programming
Published: (2003)