Cover Image

Worst-case complexity analysis of derivative-free methods for multi-objective optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liuzzi, Giampaolo, Lucidi, Stefano
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C29, 90C30, 90C56
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A linesearch-based derivative-free method for noisy black-box problems
by: De Santis, Alberto, et al.
Published: (2025)

An interior point method for nonlinear constrained derivative-free optimization
by: Brilli, Andrea, et al.
Published: (2021)

Worst case complexity bounds for linesearch-type derivative-free algorithms
by: Brilli, Andrea, et al.
Published: (2023)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
by: Cesaroni, Edoardo, et al.
Published: (2026)

Projected Gradient Methods with Momentum
by: Lapucci, Matteo, et al.
Published: (2026)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

A Globally Convergent Gradient Method with Momentum
by: Lapucci, Matteo, et al.
Published: (2024)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
by: Brilli, Andrea, et al.
Published: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
by: Cecere, Francesco, et al.
Published: (2025)

A derivative-free trust-region approach for Low Order-Value Optimization problems
by: Schwertner, Anderson E., et al.
Published: (2025)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
by: Audet, Charles, et al.
Published: (2026)

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
by: Audet, Charles, et al.
Published: (2025)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

On Complexity of Model-Based Derivative-Free Methods
by: Chaudhry, Abraar, et al.
Published: (2025)

Perpertual Coupled Simulated Annealing for Continuous Optimization
by: Gonçalves-e-Silva, Kayo, et al.
Published: (2018)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
by: Xie, Pengcheng, et al.
Published: (2023)

Optimization of Closed-Loop Shallow Geothermal Systems Using Analytical Models
by: Heinzel, Oliver, et al.
Published: (2026)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
by: Göß, Adrian, et al.
Published: (2024)

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods
by: Gebken, Bennet
Published: (2024)

Generalized Reduced Jacobian Method
by: Maghri, M. El, et al.
Published: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
by: Lapucci, Matteo, et al.
Published: (2024)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
by: Mansueto, Pierluigi
Published: (2025)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
by: Chen, Jian, et al.
Published: (2024)

First-order Methods for Unconstrained Vector Optimization Problems: A Unified Majorization-Minimization Perspective
by: Chen, Jian, et al.
Published: (2024)

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
by: Chen, Jian, et al.
Published: (2024)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
by: Deng, Kangkang, et al.
Published: (2024)

Stochastic block coordinate and function alternation for multi-objective optimization and learning
by: Tran, Trang H., et al.
Published: (2026)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)

An accelerated primal-dual flow for linearly constrained multiobjective optimization
by: Luo, Hao, et al.
Published: (2025)

Depth-first directional search for nonconvex optimization
by: Zhang, Yuxuan, et al.
Published: (2024)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
by: Diouane, Youssef, et al.
Published: (2024)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
by: Liu, Zekun, et al.
Published: (2026)

A solution method for arbitrary polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

PDFO: A Cross-Platform Package for Powell's Derivative-Free Optimization Solvers
by: Ragonneau, Tom M., et al.
Published: (2023)