Affiliation:
1. MIREA - Russian Technological University
Abstract
Objectives. A frequently used method for obtaining Pareto-optimal solutions is to minimize a selected quality index under restrictions of the other quality indices, whose values are thus preset. For a scalar objective function, the global minimum is sought that contains the restricted indices as penalty terms. However, the landscape of such a function has steep-ascent areas, which significantly complicate the search for the global minimum. This work compared the results of various heuristic algorithms in solving problems of this type. In addition, the possibility of solving such problems using the sequential quadratic programming (SQP) method, in which the restrictions are not imposed as the penalty terms, but included into the Lagrange function, was investigated.Methods. The experiments were conducted using two analytically defined objective functions and two objective functions that are encountered in problems of multi-objective optimization of characteristics of analog filters. The corresponding algorithms were realized in the MATLAB environment.Results. The only heuristic algorithm shown to obtain the optimal solutions for all the functions is the particle swarm optimization algorithm. The sequential quadratic programming (SQP) algorithm was applicable to one of the analytically defined objective functions and one of the filter optimization objective functions, as well as appearing to be significantly superior to heuristic algorithms in speed and accuracy of solutions search. However, for the other two functions, this method was found to be incapable of finding correct solutions.Conclusions. A topical problem is the estimation of the applicability of the considered methods to obtaining Pareto-optimal solutions based on preliminary analysis of properties of functions that determine the quality indices.
Reference15 articles.
1. Karpenko A.P. Sovremennye algoritmy poiskovoi optimizatsii. Algoritmy, vdokhnovlennye prirodoi (Modern Search Optimization Algorithms. Nature-Inspired Optimization Algorithms). Moscow: Baumanpress; 2021. 448 p. (in Russ). ISBN 978-5-7038-5563-8
2. Arora J.S. Introduction to Optimum Design. 4th edition. Elsevier; 2017. 945 p.
3. Gill Ph.E., Murray W., Wright M.H. Practical Optimization. London: Academic Press; 1981. 402 p. [Gill F., Myurrei U., Rait M. Prakticheskaya optimizatsiya (Practical Optimization): transl. from Engl. Moscow: Mir; 1985. 509 p. (in Russ.).]
4. Ninul A.S. Optimizatsiya tselevykh funktsii. Analitika. Chislennye metody. Planirovanie eksperimenta (Optimization of Objective Functions. Analytics. Numerical Methods. Design of Experiments). Moscow: Fizmatizdat; 2009. 336 p. (in Russ.).
5. Jamil M., Yang X. A literature survey of benchmark functions for global optimization problems. Int. Journal of Mathematical Modelling and Numerical Optimization. 2013;4(2):150-194. http://doi.org/10.1504/IJMMNO.2013.055204
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献