Complexity of gradient descent for multiobjective optimization
From MaRDI portal
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
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
- Existence theorems in vector optimization
- First-order methods in optimization
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- 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
(46)- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- Conditional gradient method for multiobjective optimization
- Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach
- On q-steepest descent method for unconstrained multiobjective optimization problems
- Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
- Gradient based biobjective shape optimization to improve reliability and cost of ceramic components
- On efficiency of a single variable bi-objective optimization algorithm
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Convergence rates analysis of a multiobjective proximal gradient method
- Inexact gradient projection method with relative error tolerance
- Memory gradient method for multiobjective optimization
- scientific article; zbMATH DE number 4172753 (Why is no real title available?)
- scientific article; zbMATH DE number 3637739 (Why is no real title available?)
- On high-order model regularization for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Convergence rate of gradient descent method for multi-objective optimization
- An incremental descent method for multi-objective optimization
- An accelerated proximal gradient method for multiobjective optimization
- Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
- Adaptive sampling stochastic multigradient algorithm for stochastic multiobjective optimization
- A Barzilai-Borwein descent method for multiobjective optimization problems
- MOEA/D with gradient-enhanced kriging for expensive multiobjective optimization
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- A proximal gradient method with an explicit line search for multiobjective optimization
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Cubic regularization technique of the Newton method for vector optimization
- TRFD: a derivative-free trust-region method based on finite differences for composite nonsmooth optimization
- On the convergence of Newton-type proximal gradient method for multiobjective optimization problems
- The Dai–Liao-type conjugate gradient methods for solving vector optimization problems
- Toward finding strong Pareto optimal policies in multi-agent reinforcement learning
- Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization
- On the convergence analysis of a proximal gradient method for multiobjective optimization
- Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
- A generalized conditional gradient method for multiobjective composite optimization problems
- Multi-objective meta-learning
- Effective front-descent algorithms with convergence guarantees
- Synchronizing pretrained kernel regressors with applications to American option pricing
- Complexity bounds for smooth multiobjective optimization
- A boosted proximal point method for difference of convex functions in multiobjective optimization and the growth of multiproduct firms
- Steepest descent method for multiobjective optimization problems of interval-valued maps
- Objective-function free multi-objective optimization: rate of convergence and performance of an Adagrad-like algorithm
- New computable algorithms for smooth multiobjective optimization problems
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)
