Abstract

This paper introduces a new filled function method based on the dimensionality reduction technique for the global minimization problem. By utilizing the so called α - dense curves, we first transform the original function of n-variables into a single variable function, and then minimize the transformed function with the filled function method. The constructed filled function contains just one parameter which can be adjusted readily during the iterative process. The theoretical properties of the filled function are discussed, and the filled function algorithm is given. At last, a few numerical experiments are included.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.