Cover Image

Birkhoff interpolation models for optimization with some available derivatives

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Larson, Jeffrey, Menickelly, Matt, Toler, Evan
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 68Q25, 90C56, 41A05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
by: Suvorikova, Alexandra, et al.
Published: (2026)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

An optimal lower bound for smooth convex functions
by: Florea, Mihai I., et al.
Published: (2024)

Curvature-Aware Derivative-Free Optimization
by: Kim, Bumsu, et al.
Published: (2021)

Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)

An Optimal Interpolation Set for Model-Based Derivative-Free Optimization Methods
by: Ragonneau, Tom M., et al.
Published: (2023)

A template for gradient norm minimization
by: Florea, Mihai I.
Published: (2024)

Adaptive first-order methods with enhanced worst-case rates
by: Florea, Mihai I.
Published: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

On the Hardness of Short and Sign-Compatible Circuit Walks
by: Borgwardt, Steffen, et al.
Published: (2024)

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

The Hard-Constraint PINNs for Interface Optimal Control Problems
by: Lai, Ming-Chih, et al.
Published: (2023)

Saddle Networks: Structure-Preserving Architectures for Convex-Concave Functions
by: Warin, Xavier
Published: (2026)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
by: Katende, Ronald
Published: (2026)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

On the analysis of optimization with fixed-rank matrices: a quotient geometric view
by: Dong, Shuyu, et al.
Published: (2022)

Bilateral facial reduction: qualification-free subdifferential calculus and exact duality
by: Scott, Matthew S.
Published: (2025)

On the Hardness of the $L_1-L_2$ Regularization Problem
by: Ouyang, Yuyuan, et al.
Published: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

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

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
by: Starnes, Andrew, et al.
Published: (2023)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)

CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
by: Chen, Yiwen, et al.
Published: (2025)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Micro-Macro Decomposition of Particle Swarm Optimization Methods
by: Herty, Michael, et al.
Published: (2025)

Well-posedness and mean-field limit estimate of a consensus-based algorithm for min-max problems
by: Huang, Hui, et al.
Published: (2026)

A particle consensus approach to solving nonconvex-nonconcave min-max problems
by: Borghi, Giacomo, et al.
Published: (2024)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
by: Kitaoka, Akira
Published: (2024)