New computable algorithms for smooth multiobjective optimization problems
Preprint
Abstract
We propose new practical algorithms for solving smooth multiobjective optimization problems based on determining joint decreasing directions via suitable linear programming problems. The presented iterative method is specialized for unconstrained, sign constrained and linearly constrained multiobjective optimization problems. In all cases we show that the objective function values sequence is decreasing with respect to the considered nonnegative orthant while the iterates are feasible. Furthermore, we prove that every accumulation point of the sequence generated by the algorithm, if any, is a substationary point to the considered multiobjective optimization problem, and, under convexity assumptions, it is actually a weakly Pareto efficient (also known as weakly Pareto-optimal) point. Different to similar algorithms from the literature, the ones proposed in this work involve joint decreasing directions that are easily computable in polynomial time by solving linear programming problems. The computational performance of our algorithms has been illustrated on convex unconstrained and convex linearly constrained multiobjective optimization problems.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- A Barzilai-Borwein descent method for multiobjective optimization problemsEuropean Journal of Operational Research, 2023
- A Strongly Convergent Proximal Point Method for Vector OptimizationJournal of Optimization Theory and Applications, 2021
- Inexact projected gradient method for vector optimizationComputational Optimization and Applications, 2012
- Convergence of the projected gradient method for quasiconvex multiobjective optimizationNonlinear Analysis, 2011
- Conjugate duality in vector optimization and some applications to the vector variational inequalityJournal of Mathematical Analysis and Applications, 2007
- A steepest descent method for vector optimizationJournal of Computational and Applied Mathematics, 2005
- A Projected Gradient Method for Vector Optimization ProblemsComputational Optimization and Applications, 2004
- Stochastic Method for the Solution of Unconstrained Vector Optimization ProblemsJournal of Optimization Theory and Applications, 2002
- Steepest descent methods for multicriteria optimizationMathematical Methods of Operations Research, 2000
- Dominating Sets for Convex Functions with Some ApplicationsJournal of Optimization Theory and Applications, 1998