Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization

DOI10.1007/S11590-022-01932-3MaRDI QIDQ6097486zbMATH OpenOpenAlexFDO

Authors R. Garmanjani

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

zbMATH Keywords

convex smooth unconstrainedmultiobjective optimizationtrust-region methodsworst-case complexity

Mathematics Subject Classification ID

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

Recommendations

• Trust region methods for solving multiobjective optimisation
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• scientific article; zbMATH DE number 1282016
• A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
• Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
• scientific article; zbMATH DE number 1778088
• scientific article; zbMATH DE number 2075763
• On the convergence of a wide range of trust region methods for unconstrained optimization
• A trust region algorithm for constrained nonsmooth optimization problems

Cites work

• A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
• A trust-region algorithm for heterogeneous multiobjective optimization
• A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
• Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
• Adaptive Scalarization Methods in Multiobjective Optimization
• An augmented Lagrangian algorithm for multi-objective optimization
• Complexity of gradient descent for multiobjective optimization
• Introductory lectures on convex optimization. A basic course.
• Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
• Newton's method for multiobjective optimization
• Nonlinear multiobjective optimization
• Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
• On high-order model regularization for multiobjective optimization
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
• On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
• Optimization models
• Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
• Steepest descent methods for multicriteria optimization.
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• Trust Region Methods
• Trust region methods for solving multiobjective optimisation
• Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
• Vector Optimization
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization

Cited in

(2)

• scientific article; zbMATH DE number 1778088 (Why is no real title available?)
• Cubic regularization technique of the Newton method for vector optimization

This page was built for publication: Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization

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