:: Library Catalog

Cover Image

Saved in:

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

Similar Items

First-Order Sparse Convex Optimization: Better Rates with Sparse Updates
by: Garber, Dan
Published: (2025)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron
by: Garber, Dan
Published: (2025)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

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

Proximal Oracles for Optimization and Sampling
by: Liang, Jiaming, et al.
Published: (2024)

A Proximal Method for Composite Optimization with Smooth and Convex Components
by: Uzun, Samet, et al.
Published: (2025)

A Proximal Variable Smoothing for Nonsmooth Minimization Involving Weakly Convex Composite with MIMO Application
by: Kume, Keita, et al.
Published: (2024)

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
by: Garber, Dan, et al.
Published: (2024)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
by: Pougkakiotis, Spyridon, et al.
Published: (2022)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Accelerated Frank-Wolfe Algorithms: Complementarity Conditions and Sparsity
by: Garber, Dan
Published: (2025)

An Adaptive Regularized Proximal Newton-Type Methods for Composite Optimization over the Stiefel Manifold
by: Wang, Qinsi, et al.
Published: (2024)

Online Convex Optimization with a Separation Oracle
by: Mhammedi, Zakaria
Published: (2024)

Proximal Quasi-Newton Method for Composite Optimization over the Stiefel Manifold
by: Wang, Qinsi, et al.
Published: (2025)

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
by: Qiu, Pu, et al.
Published: (2026)

A Proximal Augmented Lagrangian Method Based on Quadratic Approximations for Weakly Convex Optimization
by: Zhang, Yule, et al.
Published: (2026)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
by: Chen, Lesi, et al.
Published: (2025)

Tight Lower Bounds for the Bit and Inner Product Oracle for Constrained Convex Optimization
by: Basu, Amitabh, et al.
Published: (2025)

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

A Riemannian Proximal Newton Method
by: Si, Wutao, et al.
Published: (2023)

Blackwell's Approachability with Approximation Algorithms
by: Garber, Dan, et al.
Published: (2025)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
by: Jiang, Bo, et al.
Published: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)

A Riemannian Proximal Newton-CG Method
by: Huang, Wen, et al.
Published: (2024)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
by: Rajoriya, Vaibhav, et al.
Published: (2025)

Prox-PEP: A Proximal Partial Exact Penalty Algorithm for Weakly Convex Stochastic Nonlinear Programming
by: Tang, Lixin, et al.
Published: (2026)

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
by: Kerger, Phillip, et al.
Published: (2024)

A Newton-Type Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2022)

A Smooth Approximation Framework for Weakly Convex Optimization
by: Deng, Qi, et al.
Published: (2025)

On the Convergence of Proximal Algorithms for Weakly-convex Min-max Optimization
by: Tapia-Riera, Guido, et al.
Published: (2026)

Policy Optimization in Robust Control: Weak Convexity and Subgradient Methods
by: Watanabe, Yuto, et al.
Published: (2025)

On Weakly Contracting Dynamics for Convex Optimization
by: Centorrino, Veronica, et al.
Published: (2024)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
by: Moon, Sang Bin, et al.
Published: (2024)

A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
by: Diouane, Youssef, et al.
Published: (2024)

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

Stochastic Newton Proximal Extragradient Method
by: Jiang, Ruichen, et al.
Published: (2024)