:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Cristofari, Andrea
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2506.11971
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A Trust Region Method with Regularized Barzilai-Borwein Step-Size for Large-Scale Unconstrained Optimization
by: Xu, Xin, et al.
Published: (2024)

OFF (Proximal) Newton-type Methods with Inexact Derivatives for Unconstrained Optimization
by: Zhu, Hong
Published: (2025)

Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization
by: Peng, Zedong, et al.
Published: (2025)

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

Multilevel Regularized Newton Methods with Fast Convergence Rates
by: Tsipinakis, Nick, et al.
Published: (2024)

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
by: Li, Mengmou, et al.
Published: (2025)

Local SGD for Near-Quadratic Problems: Improving Convergence under Unconstrained Noise Conditions
by: Sadchikov, Andrey, et al.
Published: (2024)

Nonlinear Splitting for Gradient-Based Unconstrained and Adjoint Optimization
by: Tran, Brian K., et al.
Published: (2025)

Efficient Implementation of Third-Order Tensor Methods with Adaptive Regularization for Unconstrained Optimization
by: Cartis, Coralia, et al.
Published: (2024)

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction
by: Cristofari, Andrea, et al.
Published: (2025)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems
by: Fong, Robert Simon, et al.
Published: (2024)

An Unconstrained Optimization Approach to Moment Fitting with Phase Type Distributions
by: Sherzer, Eliran, et al.
Published: (2025)

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

$\ell_{1\text{-}2}$ Regularization for Sparse Optimization: Consistency and Global Convergence
by: Hu, Yaohua, et al.
Published: (2026)

Nonlinear Programming Solvers for Unconstrained and Constrained Optimization Problems: a Benchmark Analysis
by: Lavezzi, Giovanni, et al.
Published: (2022)

Efficient Gradient-Enhanced Bayesian Optimizer with Comparisons to Conjugate-Gradient and Quasi-Newton Optimizers for Unconstrained Local Optimization
by: Marchildon, André L., et al.
Published: (2025)

Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods
by: O'Leary-Roseberry, Thomas, et al.
Published: (2024)

Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
by: Tsipinakis, Nick, et al.
Published: (2023)

Convergence Analysis of Distributed Optimization: A Dissipativity Framework
by: Karakai, Aron, et al.
Published: (2025)

Global Convergence of High-Order Regularization Methods with Sums-of-Squares Taylor Models
by: Zhu, Wenqi, et al.
Published: (2024)

Convergence Analysis of Stochastic Accelerated Gradient Methods for Generalized Smooth Optimizations
by: Yu, Chenhao, et al.
Published: (2025)

INTHOP: A Second-Order Globally Convergent Method for Nonconvex Optimization
by: Kumar, Krishan, et al.
Published: (2025)

A Regularized Hessian-Free Inexact Newton-Type Method with Global $\mathcal{O}(k^{-2})$ Convergence
by: Maia, Leandro Farias, et al.
Published: (2026)

Fully Unconstrained Online Learning
by: Cutkosky, Ashok, et al.
Published: (2024)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
by: Zhou, Dongruo, et al.
Published: (2018)

Adaptive Regularization within Trust Region Methods for Stochastic Nonconvex Optimization
by: Ha, Yunsoo, et al.
Published: (2026)

Full-Low Evaluation Methods For Bound and Linearly Constrained Derivative-Free Optimization
by: Royer, Clément W., et al.
Published: (2023)

RanSOM: Second-Order Momentum with Randomized Scaling for Constrained and Unconstrained Optimization
by: Chayti, El Mahdi
Published: (2026)

Distributed Nonconvex Optimization with Exponential Convergence Rate via Hybrid Systems Methods
by: Hendrickson, Katherine R., et al.
Published: (2025)

Point Convergence Analysis of the Accelerated Gradient Method for Multiobjective Optimization: Continuous and Discrete
by: Yin, Yingdong
Published: (2025)

Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis
by: Kim, Jungbin, et al.
Published: (2022)

Local Convergence of Adaptively Regularized Tensor Methods
by: Welzel, Karl, et al.
Published: (2025)

Subspace Newton's Method for $\ell_0$-Regularized Optimization Problems with Box Constraint
by: Ye, Yuge, et al.
Published: (2025)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
by: Xiao, Nachuan, et al.
Published: (2023)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
by: Figueira, José Rui, et al.
Published: (2024)

Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers
by: Mazumder, Arul, et al.
Published: (2024)

Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling
by: Grange, Camille, et al.
Published: (2024)