Cover Image

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nozawa, Ryota, Poirion, Pierre-Louis, Takeda, Akiko
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C56 (Primary) 49J52, 60B20, 90C06, 90C25 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
by: Higuchi, Rei, et al.
Published: (2024)

Randomized Subspace Nesterov Accelerated Gradient
by: Omiya, Gaku, et al.
Published: (2026)

Convergence Analysis of Randomized Subspace Normalized SGD under Heavy-Tailed Noise
by: Omiya, Gaku, et al.
Published: (2026)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods
by: Gebken, Bennet
Published: (2024)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
by: Rando, Marco, et al.
Published: (2025)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

Isolated Calmness in Regularized Convex Optimization
by: Nghia, Tran T. A., et al.
Published: (2026)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

Optimal Methods for Unknown Piecewise Smooth Problems I: Convex Optimization
by: Lin, Zhenwei, et al.
Published: (2026)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
by: Ma, Chiyu, et al.
Published: (2026)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method
by: Chen, Yiwen, et al.
Published: (2023)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
by: Zhang, Minxin, et al.
Published: (2024)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

Tractable downfall of basis pursuit in structured sparse optimization
by: Marmary, Maya V., et al.
Published: (2025)

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

Aggregating regular norms
by: Juditsky, Anatoli, et al.
Published: (2022)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
by: Deng, Kangkang, et al.
Published: (2024)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
by: Leconte, Geoffroy, et al.
Published: (2024)

Depth-first directional search for nonconvex optimization
by: Zhang, Yuxuan, et al.
Published: (2024)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)