An incremental descent method for multi-objective optimization

DOI10.1080/10556788.2022.2124989MaRDI QIDQ5882236zbMATH OpenOpenAlexFDO

Authors I. F. D. Oliveira, R. H. C. Takahashi

Publication date 15 March 2023

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.11845

zbMATH Keywords

complexity reductiongradient descentmulti-objective optimization

Mathematics Subject Classification ID

Numerical analysis (65-XX) Mathematical programming (90Cxx)

Recommendations

• Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
• Complexity of gradient descent for multiobjective optimization
• Convergence rate of gradient descent method for multi-objective optimization
• Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
• Conditional gradient method for multiobjective optimization

Cites work

• A projected gradient method for vector optimization problems
• A Wolfe Line Search Algorithm for Vector Optimization
• Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality
• Complexity of gradient descent for multiobjective optimization
• Convergence of the projected gradient method for quasiconvex multiobjective optimization
• Lectures on convex optimization
• Linear and nonlinear programming.
• Multicriteria optimization with a multiobjective golden section line search
• Newton's method for multiobjective optimization
• On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
• On the convergence of steepest descent methods for multiobjective optimization
• Proximal gradient methods for multiobjective optimization and their applications
• Quasi-Newton's method for multiobjective optimization
• Steepest descent methods for multicriteria optimization.
• Support-vector networks

Cited in

(3)

• The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
• Complexity of gradient descent for multiobjective optimization
• Improved front steepest descent for multi-objective optimization

This page was built for publication: An incremental descent method for multi-objective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882236)