Copertina

Weak Proximal Newton Oracles for Composite Convex Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Garber, Dan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Online Convex Optimization with a Separation Oracle
di: Mhammedi, Zakaria
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

A Riemannian Proximal Newton Method
di: Si, Wutao, et al.
Pubblicazione: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization
di: Zhou, Yuan, et al.
Pubblicazione: (2025)

Optimal Decentralized Composite Optimization for Convex Functions
di: Ye, Haishan, et al.
Pubblicazione: (2023)