Complexity of gradient descent for multiobjective optimization
From MaRDI portal
Publication:5198047
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
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
- Existence theorems in vector optimization
- First-order methods in optimization
- Introductory lectures on convex optimization. A basic course.
- Newton's method for multiobjective optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Proximal Methods in Vector Optimization
- Steepest descent methods for multicriteria optimization.
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- Worst case complexity of direct search
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Cited in
(25)- On high-order model regularization for multiobjective optimization
- scientific article; zbMATH DE number 4172753 (Why is no real title available?)
- 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
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- An accelerated proximal gradient method for multiobjective optimization
- The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
- 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
- Inexact gradient projection method with relative error tolerance
- Memory gradient method for multiobjective optimization
- MOEA/D with gradient-enhanced kriging for expensive 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
- scientific article; zbMATH DE number 3637739 (Why is no real title available?)
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)
