Cover Image

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cristofari, Andrea, De Santis, Marianna, Lucidi, Stefano, Liuzzi, Giampaolo
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complexity results and active-set identification of a derivative-free method for bound-constrained problems
by: Brilli, Andrea, et al.
Published: (2024)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
by: Liuzzi, Giampaolo, et al.
Published: (2025)

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

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)

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

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

On the Batch Size Selection in Stochastic Gradient Methods Using No-Replacement Sampling
by: Boresta, Marco, et al.
Published: (2025)

CMA Light: a novel Minibatch Algorithm for large-scale non convex finite sum optimization
by: Coppola, Corrado, et al.
Published: (2023)

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

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

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

Algorithms and Differential Game Representations for Exploring Nonconvex Pareto Fronts in High Dimensions
by: Liu, Shanqing, et al.
Published: (2026)

Full Convergence of Regularized Methods for Unconstrained Optimization
by: Cristofari, Andrea
Published: (2025)

Block cubic Newton with greedy selection
by: Cristofari, Andrea
Published: (2024)

Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness
by: Seccia, Ruggiero, et al.
Published: (2022)

Computing the Pareto Front by Polynomial Elimination, With an Application From System Identification
by: van Rooij, Hans, et al.
Published: (2026)

Sub-sampled Trust-Region Methods with Deterministic Worst-Case Complexity Guarantees
by: Goncalves, Max L. N., et al.
Published: (2025)

ROBBO: An Efficient Method for Pareto Front Estimation with Guaranteed Accuracy
by: Boffadossi, Roberto, et al.
Published: (2025)

Multiobjective Optimization under Uncertainties using Conditional Pareto Fronts
by: Trappler, Victor, et al.
Published: (2025)

Worst-Case Services and State-Based Scheduling
by: Xu, Yike, et al.
Published: (2021)

Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
by: Roberts, Lindon, et al.
Published: (2026)

Pareto Front Shape-Agnostic Pareto Set Learning in Multi-Objective Optimization
by: Ye, Rongguang, et al.
Published: (2024)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

Non-Extreme Individual Minima for Improved Pareto Front Sampling Efficiency and Decision-Making
by: Herrmann-Wicklmayr, Markus, et al.
Published: (2026)

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

Interpolation Constraints for Computing Worst-Case Bounds in Performance Estimation Problems
by: Rubbens, Anne, et al.
Published: (2023)

Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
by: Gruntkowska, Kaja, et al.
Published: (2024)

An Integrated Cyber-Physical Risk Assessment Framework for Worst-Case Attacks in Industrial Control Systems
by: Aftabi, Navid, et al.
Published: (2023)

Approximate Information States for Worst-Case Control and Learning in Uncertain Systems
by: Dave, Aditya, et al.
Published: (2023)

A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints
by: Tuan, Tran Anh, et al.
Published: (2024)

Probabilistic Iterative Hard Thresholding for Sparse Learning
by: Bergamaschi, Matteo, et al.
Published: (2024)

Log-Sum Regularized Kaczmarz Algorithms for High-Order Tensor Recovery
by: Henneberger, Katherine, et al.
Published: (2023)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
by: De Santis, Marianna, et al.
Published: (2026)

Best-Worst Disaggregation: An approach to the preference disaggregation problem
by: Brunelli, Matteo, et al.
Published: (2024)

On the Complexity of Lower-Order Implementations of Higher-Order Methods
by: Doikov, Nikita, et al.
Published: (2025)

Pareto-Optimal Linear Programming
by: van Rossum, Bart, et al.
Published: (2025)

Optimization with First Order Algorithms
by: Dossal, Charles, et al.
Published: (2024)

A Generalized Analytical Framework for the Nonlinear Best-Worst Method
by: Ratandhara, Harshit M., et al.
Published: (2025)

Exact Verification of First-Order Methods via Mixed-Integer Linear Programming
by: Ranjan, Vinit, et al.
Published: (2024)