:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Thomsen, Daniel Berg, Doikov, Nikita
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2404.17543
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Universal Reduced-Operator Method and High-Order Global Curvature Bounds
by: Doikov, Nikita, et al.
Published: (2025)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
by: Doikov, Nikita, et al.
Published: (2024)

Gradient-Normalized Smoothness for Optimization with Approximate Hessians
by: Semenov, Andrei, et al.
Published: (2025)

Improving Stochastic Cubic Newton with Momentum
by: Chayti, El Mahdi, et al.
Published: (2024)

Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods
by: Chayti, El Mahdi, et al.
Published: (2023)

Cubic regularized subspace Newton for non-convex optimization
by: Zhao, Jim, et al.
Published: (2024)

High-order Accumulative Regularization for Gradient Minimization in Convex Programming
by: Ji, Yao, et al.
Published: (2025)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

Inertial Quadratic Majorization Minimization with Application to Kernel Regularized Learning
by: Heng, Qiang, et al.
Published: (2025)

On the Set of Possible Minimizers of a Sum of Convex Functions
by: Zamani, Moslem, et al.
Published: (2024)

A Tight Theory of Error Feedback Algorithms in Distributed Optimization
by: Thomsen, Daniel Berg, et al.
Published: (2026)

Why Study the Spherical Convexity of Non-Homogeneous Quadratic Functions, and What Makes It Surprising?
by: Bolton, R., et al.
Published: (2024)

An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
by: Upadhyaya, Manu, et al.
Published: (2026)

On Representing Convex Quadratically Constrained Quadratic Programs via Graph Neural Networks
by: Wu, Chenyang, et al.
Published: (2024)

Differentiability and Regularization of Parametric Convex Value Functions in Stochastic Multistage Optimization
by: Franc, Adrien Le, et al.
Published: (2022)

Estimating Sequences with Memory for Minimizing Convex Non-smooth Composite Functions
by: Dosti, Endrit, et al.
Published: (2025)

Global and Robust Optimization for Non-Convex Quadratic Programs
by: Marousi, Asimina, et al.
Published: (2025)

Constructing Tight Quadratic Relaxations for Global Optimization: II. Underestimating Difference-of-Convex (D.C.) Functions
by: Strahl, William R., et al.
Published: (2024)

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
by: Strahl, William R., et al.
Published: (2024)

Convex Submodular Minimization with Indicator Variables
by: Gomez, Andres, et al.
Published: (2025)

Convex Submodular Minimization with Indicator Variables
by: Han, Shaoning, et al.
Published: (2022)

A Log-domain Interior Point Method for Convex Quadratic Games
by: Liu, Bingqi, et al.
Published: (2024)

Tightening Quadratic Convex Relaxations for the AC Optimal Transmission Switching Problem
by: Guo, Cheng, et al.
Published: (2022)

Solving Convex Quadratic Optimization with Indicators Over Structured Graphs
by: Bhathena, Aaresh, et al.
Published: (2026)

On the Effect of Quadratic Regularization in Direct Data-Driven LQR
by: Klädtke, Manuel, et al.
Published: (2026)

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

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
by: Li, Shaoze, et al.
Published: (2025)

A Quadratically-Constrained Convex Approximation for the AC Optimal Power Flow
by: Constante-Flores, Gonzalo E., et al.
Published: (2025)

Tight analyses of first-order methods with error feedback
by: Thomsen, Daniel Berg, et al.
Published: (2025)

Last-Iterate Complexity of SGD for Convex and Smooth Stochastic Problems
by: Garrigos, Guillaume, et al.
Published: (2025)

A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees
by: Bhathena, Aaresh, et al.
Published: (2024)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

Revisiting Strong Duality, Hidden Convexity, and Gradient Dominance in the Linear Quadratic Regulator
by: Watanabe, Yuto, et al.
Published: (2025)

Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity
by: Sharf, Miel, et al.
Published: (2019)

On a Family of Relaxed Gradient Descent Methods for Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2024)

Gradient Regularized Newton Boosting Trees with Global Convergence
by: Zozoulenko, Nikita, et al.
Published: (2026)