Abstract
A hybrid global optimization algorithm is proposed aimed at the class of objective functions with properties typical of the problems of non-linear least squares regression. Three components of hybridization are considered: simplicial partition of the feasible region, indicating and excluding vicinities of the main local minimizers from global search, and computing the indicated local minima by means of an efficient local descent algorithm. The performance of the algorithm is tested using a collection of non-linear least squares problems evaluated by other authors as difficult global optimization problems.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
