:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lessard, Laurent, Udell, Madeleine
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2501.04972
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An automatic system to detect equivalence between iterative algorithms
by: Zhao, Shipu, et al.
Published: (2021)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?
by: Gao, Wenzhi, et al.
Published: (2024)

On the (linear) convergence of Generalized Newton Inexact ADMM
by: Frangella, Zachary, et al.
Published: (2023)

"It Was a Magical Box": Understanding Practitioner Workflows and Needs in Optimization
by: Lawless, Connor, et al.
Published: (2025)

Explicit Agent-Level Optimal Cooperative Controllers for Dynamically Decoupled Systems with Output Feedback
by: Kashyap, Mruganka, et al.
Published: (2019)

Optimal Control of Multi-Agent Systems with Processing Delays
by: Kashyap, Mruganka, et al.
Published: (2022)

SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimates
by: Frangella, Zachary, et al.
Published: (2022)

Scalable Approximate Optimal Diagonal Preconditioning
by: Gao, Wenzhi, et al.
Published: (2023)

PROMISE: Preconditioned Stochastic Optimization Methods by Incorporating Scalable Curvature Estimates
by: Frangella, Zachary, et al.
Published: (2023)

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
by: He, Chang, et al.
Published: (2025)

GeNIOS: an (almost) second-order operator-splitting solver for large-scale convex optimization
by: Diamandis, Theo, et al.
Published: (2023)

Convex semi-infinite programming algorithms with inexact separation oracles
by: Oustry, Antoine, et al.
Published: (2023)

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
by: Van Scoy, Bryan, et al.
Published: (2025)

Gradient Methods with Online Scaling Part I. Theoretical Foundations
by: Gao, Wenzhi, et al.
Published: (2025)

Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent
by: Chu, Ya-Chi, et al.
Published: (2025)

Gradient Methods with Online Scaling Part II. Practical Aspects
by: Chu, Ya-Chi, et al.
Published: (2025)

Gradient Methods with Online Scaling
by: Gao, Wenzhi, et al.
Published: (2024)

Stochastic LQR Design With Disturbance Preview
by: Liu, Jietian, et al.
Published: (2024)

Challenges in Training PINNs: A Loss Landscape Perspective
by: Rathore, Pratik, et al.
Published: (2024)

Understanding Fixed Predictions via Confined Regions
by: Lawless, Connor, et al.
Published: (2025)

Stealthy Optimal Range-Sensor Placement for Target Localization
by: Nooshabadi, Mohammad Hussein Yoosefian, et al.
Published: (2024)

Turbocharging Gaussian Process Inference with Approximate Sketch-and-Project
by: Rathore, Pratik, et al.
Published: (2025)

An iterative algorithm for the square-root Lasso
by: Boccacci, Patrizia, et al.
Published: (2025)

Adaptive Acceleration Without Strong Convexity Priors Or Restarts
by: Cavalcanti, Joao V., et al.
Published: (2025)

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms
by: Simon, Emile, et al.
Published: (2011)

Adaptive Backtracking Line Search
by: Cavalcanti, Joao V., et al.
Published: (2024)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)

A policy iteration algorithm for non-Markovian control problems
by: Possamaï, Dylan, et al.
Published: (2024)

Randomized Nyström Preconditioned Interior Point-Proximal Method of Multipliers
by: Chu, Ya-Chi, et al.
Published: (2024)

Preconditioned Halpern iteration with adaptive anchoring parameters and an acceleration to Chambolle--Pock algorithm
by: Lv, Fangbing, et al.
Published: (2025)

Solutions to Differential Algebraic Inequalities with Composite Bernstein Polynomials
by: Hammond, Maxwell, et al.
Published: (2025)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
by: Zhou, Junpeng, et al.
Published: (2023)

Have ASkotch: A Neat Solution for Large-scale Kernel Ridge Regression
by: Rathore, Pratik, et al.
Published: (2024)

The Speed-Robustness Trade-Off for First-Order Methods with Additive Gradient Noise
by: Van Scoy, Bryan, et al.
Published: (2021)

Some iterative algorithms on Riemannian manifolds and Banach spaces with good global convergence guarantee
by: Truong, Tuyen Trung
Published: (2025)

On the equivalence between functionally affine LPV state-space representations and LFT models
by: Petreczky, Mihály, et al.
Published: (2025)

H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
by: Yoon, TaeHo, et al.
Published: (2025)