Skip to content

Similar papers

Open access Sep 2026

A Composed Alternating Relaxed Projection Algorithm for Convex Feasibility Problems

The convex feasibility problem aims to find a common point of two or more closed convex sets whose intersection is nonempty. Projection methods such as the method of alternating projections (MAP) and Douglas–Rachford (DR) are standard, but their performance depends strongly on the local geometry of the sets. In particu...

Yu-Ting Shen, Jing-Wei Liang · 0 citations
Preprint Nov 2026

Subgradient and Stochastic Finite-Difference Methods for Constrained Strongly Quasiconvex Optimization

We propose a projected subgradient method for solving quasiconvex minimization problems. By employing the Clarke subdifferential, we prove that the sequence generated by the proposed algorithm converges to a solution of the minimization problem when the objective function is locally Lipschitz continuous and strongly qu...

R. Khachatryan, F. Lara · 0 citations
#machine learning Preprint Oct 2026

Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints

We present new algorithms for stochastic optimization problems in which the objective is neither smooth nor convex, subject to a convex constraint set. Our algorithms return a $(\delta,\varepsilon)$-Goldstein stationary point, as recently defined for constrained problems by Liu et al. (2024), with improved complexities...

G. Buzaglo, Guy Kornowski · 0 citations

Polyak-Type Extragradient Methods for Monotone Root-Finding Problems

We study Polyak-type step-size selection for extragradient methods for solving deterministic and stochastic monotone root-finding problems. We show that the known projection-type correction for deterministic extragradient arises from minimizing an upper bound on the distance to a solution, paralleling the classical Pol...

Taeho Yoon, Sayantan Choudhury, Ezra Greenberg et al. · 2 citations
Preprint Sep 2026

Sampled-Max Subgradient Method for Convex Finite-Max Optimization

We study the Sampled-Max Subgradient Method (SMax-SGM) for large convex finite-max problems. Each iteration maximizes over a fresh random subset of the $N$ components and takes one subgradient of the sampled maximizer. The method is therefore stochastic subgradient descent on a sampled-max surrogate. We bound the surro...

E. Gladin, Анна Фёдорровна Попова, Georgii Babinskii · 0 citations
Preprint Oct 2026

Stochastic Linesearch Methods for Stochastic Variational Inequality Problems: Parameter-Free Schemes and Non-Monotone Variants

Much of the existing convergence guarantees and rate statements for stochastic variational inequality (SVI) problems are limited to stochastic approximation schemes that employ constant or diminishing steplength sequences bounded by some reciprocal of the Lipschitz constant $L$ of the map. This requires both knowing su...

Zhuo-Yu Xiao, U. Shanbhag, Yue Xie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.