Complexity of gradient descent for multiobjective optimization

DOI10.1080/10556788.2018.1510928zbMATH Open1429.90067OpenAlexW2889351029WikidataQ129318439 ScholiaQ129318439MaRDI QIDQ5198047FDOQ5198047

Authors: Jörg Fliege, A. Ismael F. Vaz, L. N. Vicente 

Publication date: 2 October 2019

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

Full work available at URL: https://eprints.soton.ac.uk/423833/1/wcc_moo.pdf

Recommendations

• Convergence rate of gradient descent method for multi-objective optimization
• Convergence rates analysis of a multiobjective proximal gradient method
• A nonmonotone gradient method for constrained multiobjective optimization problems
• Conditional gradient method for multiobjective optimization
• An incremental descent method for multi-objective optimization

zbMATH Keywords

multiobjective optimizationsteepest descentgradient descentworst-case complexityglobal rates

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Introductory lectures on convex optimization. A basic course.
• Title not available (Why is that?)
• First-order methods in optimization
• On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
• Worst case complexity of direct search
• Proximal Methods in Vector Optimization
• Steepest descent methods for multicriteria optimization.
• Newton's method for multiobjective optimization
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• Existence theorems in vector optimization
• A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
• Nonlinear Conjugate Gradient Methods for Vector Optimization

Cited In (25)

• Gradient based biobjective shape optimization to improve reliability and cost of ceramic components
• On efficiency of a single variable bi-objective optimization algorithm
• On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
• An inexact nonmonotone projected gradient method for constrained multiobjective optimization
• Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
• Adaptive sampling stochastic multigradient algorithm for stochastic multiobjective optimization
• A nonmonotone gradient method for constrained multiobjective optimization problems
• An accelerated proximal gradient method for multiobjective optimization
• The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
• An incremental descent method for multi-objective optimization
• A Barzilai-Borwein descent method for multiobjective optimization problems
• Conditional gradient method for multiobjective optimization
• Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
• Convergence rates analysis of a multiobjective proximal gradient method
• Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
• Convergence rate of gradient descent method for multi-objective optimization
• MOEA/D with gradient-enhanced kriging for expensive multiobjective optimization
• Inexact gradient projection method with relative error tolerance
• Memory gradient method for multiobjective optimization
• Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
• Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach
• On high-order model regularization for multiobjective optimization
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Complexity of gradient descent for multiobjective optimization

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