Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
From MaRDI portal
Publication:6097486
DOI10.1007/s11590-022-01932-3zbMath1519.90217OpenAlexW4301606287MaRDI QIDQ6097486
Publication date: 5 June 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01932-3
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29)
Cites Work
- Unnamed Item
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An augmented Lagrangian algorithm for multi-objective optimization
- Nonlinear multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- Introductory lectures on convex optimization. A basic course.
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
- Trust region methods for solving multiobjective optimisation
- Vector Optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Newton's Method for Multiobjective Optimization
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Trust Region Methods
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
- On high-order model regularization for multiobjective optimization
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
- Complexity of gradient descent for multiobjective optimization
This page was built for publication: Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization