Solving Multiobjective Optimization Problems with Inequality Constraint Using An Augmented Lagrangian Function
Abstract
We propose a method for solving multiobjective optimization problems under the constraints of inequality. In this method, the initial problem is transformed into a single-objective optimization without constraints using an augmented Lagrangian function and an ϵ-constraint approach. Indeed, the augmented Lagrangian function is used to convert a given problem with multiple objective functions into a single objective function. The ϵ-constraint approach allows for the transformation of constrained optimization problems into unconstrained optimization problems. To demonstrate the admissibility and Pareto optimality of the obtained solutions, we have provided two propositions with proofs. In addition, a comparison study is made with two other well-known and widely used methods, such as NSGA-II and BoostDMS, on convergence and distribution of obtained solutions using numerical results for fifty test problems taking in the literature. Based on all these theoretical and numerical results, we can say that the proposed method is the best way to solve multiobjective optimization problems.References
Birgin, E. & Martínez, J. On the Application of an Augmented Lagrangian Algorithm to Some Portfolio Problems. EURO Journal On Computational Optimization. 4, 79-92 (2016)
Birgin, E., Martínez, J. & Prudente, L. Optimality Properties of an Augmented Lagrangian Method on Infeasible Problems. Computational Optimization And Applications. 60, 609-631 (2015)
Birgin, E. & Martínez, J. Practical Augmented Lagrangian Methods for Constrained Optimization. Encyclopedia Of Optimization. pp. 3013-3023 (2014)
Birgin, E., Floudas, C. & Martínez, J. Global Minimization Using an Augmented Lagrangian Method with Variable Lower-Level Constraints. Mathematical Programming. 125, 139-162 (2010)
Brás, C. & Custódio, A. On the Use of Polynomial Models in Multiobjective Directional Direct Search. Computational Optimization And Applications. 77, 897-918 (2020)
Cao, Y., Seth, A. & Laird, C. An Augmented Lagrangian Interior-Point Approach for Large-Scale NLP Problems on Graphics Processing Units. Computers & Chemical Engineering. 85, 76-83 (2016)
Chen, L. & Goldfarb, D. Interior-Point L2-penalty Methods for Nonlinear Programming with Strong Global Convergence Properties. Mathematical Programming. 108, 1-36 (2006)
Cocchi, G., Lapucci, M. & Mansueto, P. Pareto Front Approximation through a Multi-Objective Augmented Lagrangian Method. EURO Journal On Computational Optimization. 9, 1-12 (2021)
Cocchi, G. & Lapucci, M. An Augmented Lagrangian Algorithm for Multi-Objective Optimization. Computational Optimization And Applications. 77, 29-56 (2020)
Custódio, A., Madeira, J., Vaz, A. & Vicente, L. Direct Multisearch for Multiobjective Optimization. SIAM Journal On Optimization. 21, 1109-1140 (2011)
Deb, K., Pratap, A., Agarwal, S. & Meyarivan, T. A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions On Evolutionary Computation. 6, 182-197 (2002)
Deb, K. Multi-Objective Optimization Using Evolutionary Algorithms. (John Wiley & Sons Inc,2001)
Deb, K. Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Evolutionary Computation. 7, 205-230 (1999)
Carvalho, E., Dos Santos, A. & Ma, T. Reduced Gradient Method Combined with Augmented Lagrangian and Barrier for the Optimal Power Flow Problem. Applied Mathematics And Computation. 200, 529-536 (2008)
Dolan, E. & Moré, J. Benchmarking Optimization Software with Performance Profiles. Mathematical Programming. 91, 201-213 (2002)
Dussault, J. & Fournier, G. On the Convergence of the Projected Gradient Method. Journal Of Optimization Theory And Applications. 77, 197-208 (1993)
Fan, S. & Yao, Y. Strong Convergence of a Projected Gradient Method. Journal Of Applied Mathematics. 2012, 1-10 (2012)
Fitriah, Z. & Anam, S. Modified Armijo Rule on Gradient Descent and Conjugate Gradient. E-Jurnal Matematika. 6, 196-204 (2017)
Fleischer, M. The Measure of Pareto Optima Applications to Multi-objective Metaheuristics. Evolutionary Multi-Criterion Optimization. pp. 519-533 (2003)
Fliege, J. & Svaiter, B. Steepest Descent Methods for Multicriteria Optimization. Mathematical Methods Of Operations Research (ZOR). 51, 479-494 (2000)
Fukuda, E. & Drummond, L. On the Convergence of the Projected Gradient Method for Vector Optimization. Optimization. A Journal Of Mathematical Programming And Operations Research. 60, 1009-1021 (2011)
Galvan, G. & Lapucci, M. On the Convergence of Inexact Augmented Lagrangian Methods for Problems with Convex Constraints. Operations Research Letters. 47, 185-189 (2019)
García-Palomares, U. & Restuccia, A. Application of the Armijo Stepsize Rule to the Solution of a Nonlinear System of Equalities and Inequalities. Journal Of Optimization Theory And Applications. 41, 405-415 (1983)
Hassan, M. & Baharum, A. Generalized Logarithmic Penalty Function Method for Solving Smooth Nonlinear Programming Involving Invex Functions. Arab Journal Of Basic And Applied Sciences. 26, 202-214 (2019)
He, S. & Zhou, S. A Nonlinear Augmented Lagrangian for Constrained Minimax Problems. Applied Mathematics And Computation. 2018, 4567-4579 (2011)
Huband, S., Hingston, P., Barone, L. & While, L. A Review of Multiobjective Test Problems and a Scalable Test Problem Toolkit. IEEE Transactions On Evolutionary Computation. 10, 477-506 (2006)
Lian, S., Meng, S. & Wang, Y. An Objective Penalty Function-Based Method for Inequality Constrained Minimization Problem. Mathematical Problems In Engineering. 2018, 1-7 (2018)
Marcilio, D. & Matioli, L. Augmented Lagrangian Applied to Convex Quadratic Problems. Applied Mathematics And Computation. 200, 480-485 (2008)
Meng, Z., Dang, C. & Yang, X. On the Smoothing of the Square-Root Exact Penalty Function for Inequality Constrained Optimization. Computational Optimization And Applications. 35, 375-398 (2006)
Pan, Y. Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem. Mathematical Problems In Engineering. 2019, 1-13 (2019)
Rocha, A., Martins, T. & Fernandes, E. An Augmented Lagrangian Fish Swarm Based Method for Global Optimization. Journal Of Computational And Applied Mathematics. 235, 4611-4620 (2011)
Som, A., Compaoré, A., Somé, K. & Somé, B. Effect of Aggregation Function in MOMA-Plus Method For Obtaining Pareto Optimal Solutions. Applications And Applied Mathematics: An International Journal (AAM). 17, Article 14 (2022)
Somé, K., Compaoré, A., Sawadogo, W. & Somé, B. Improving of Numerical Performance of The MOMA Method. International Journal Of Mathematics And Computer Research. 5, 1817-1827 (2017)
Tavares, S., Brás, C., Custódio, A., Duarte, V. & Medeiros, P. Parallel Strategies for Direct Multisearch. Numerical Algorithms. 2022, 1757-1788 (2022)
Temelcan, G., Albayrak, I. & Sivri, M. Solving Multi-Objective Linear Fractional Programming Problems via Zero-Sum Game. Applications & Applied Mathematics. 17, 12 (2022)
Tian, B., Yang, X. & Meng, K. An Interior-Point L1/2-Penalty Method for Inequality Constrained Nonlinear Optimization. Journal Of Industrial And Management Optimization. 12, 949-973 (2016)
Wu*, Z., Bai, F., Yang, X. & Zhang, L. An Exact Lower Order Penalty Function and Its Smoothing in Nonlinear Programming. Optimization. A Journal Of Mathematical Programming And Operations Research. 53, 51-68 (2004)
Zangwill, W. Non-Linear Programming Via Penalty Functions. Management Science. 13, 344-358 (1967)
Zhang, W. & Gao, T. A Min–Max Method with Adaptive Weightings for Uniformly Spaced Pareto Optimum Points. Computers & Structures. 84, 1760-1769 (2006)
Zhang, H. & Ni, Q. A New Augmented Lagrangian Method for Equality Constrained Optimization with Simple Unconstrained Subproblem. Discrete Dynamics In Nature And Society. 2017, 1-9 (2017)
- 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.
- 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.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
