Complexity bounds for smooth multiobjective optimization

DOI10.1016/J.JCO.2026.102044MaRDI QIDQ7286383zbMATH OpenFDO

Authors Phillipe R. Sampaio

Publication date 23 June 2026

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCO.2026.102044

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Abstract computational complexity for mathematical programming problems (90C60)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A method for constrained multiobjective optimization based on SQP techniques
• A steepest descent method for vector optimization
• Adaptive generalized conditional gradient method for multiobjective optimization
• An accelerated proximal gradient method for multiobjective optimization
• An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
• Complexity of gradient descent for multiobjective optimization
• Conditional gradient method for vector optimization
• Convergence rates analysis of a multiobjective proximal gradient method
• Convex optimization: algorithms and complexity
• Globally convergent Newton-type methods for multiobjective optimization
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3469437 (Why is no real title available?)
• Improved convergence rates for the multiobjective Frank-Wolfe method
• Introductory lectures on convex optimization. A basic course.
• Lower bounds for finding stationary points I
• Lower bounds for finding stationary points II: first-order methods
• MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
• Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
• Nonlinear multiobjective optimization
• On lower and upper bounds in smooth and strongly convex optimization
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
• On the convergence of steepest descent methods for multiobjective optimization
• Performance of first-order methods for smooth convex minimization: a novel approach
• Steepest descent methods for multicriteria optimization.
• Survey of multi-objective optimization methods for engineering
• Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints

This page was built for publication: Complexity bounds for smooth multiobjective optimization

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