Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
DOI10.1007/s10957-020-01781-zzbMath1468.90120arXiv1909.08099OpenAlexW3108293470MaRDI QIDQ2026717
Rohollah Garmanjani, A. L. Custódio, Youssef Diouane, Elisa Riccietti
Publication date: 20 May 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.08099
worst-case complexityderivative-free optimization methodsdirectional direct-searchmultiobjective unconstrained optimizationnonconvex smooth optimization
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- On the worst-case optimal multi-objective global optimization
- Survey of multi-objective optimization methods for engineering
- 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
- Worst case complexity of direct search
- Steepest descent methods for multicriteria optimization.
- Introductory lectures on convex optimization. A basic course.
- A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
- On efficiency of a single variable bi-objective optimization algorithm
- Cubic regularization of Newton method and its global performance
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
- Direct Multisearch for Multiobjective Optimization
- A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Introduction to Derivative-Free Optimization
- Derivative-Free and Blackbox Optimization
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- Stochastic Three Points Method for Unconstrained Smooth Minimization
- On high-order model regularization for multiobjective optimization
- Complexity of gradient descent for multiobjective optimization
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- Multicriteria Optimization
- Direct Search Based on Probabilistic Descent
- Worst case complexity of direct search under convexity
This page was built for publication: Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
