AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization

Andrei Patrascu, Ion Necoara

JMLR 2018 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 58 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use stochastic proximal point (SPP) instead of SGDconstrained stochastic optimization · Markowitz portfolio (SP500, FF100)test objective over one passImproved
vary initial stepsize and stepsize exponent for SPP vs SGD (ablation)SPP and SGD · Markowitz portfolio (SP500, FF100)sensitivity to stepsizeImproved
increase stepsize exponent gamma (ablation)SPP and RSPP · constrained least squares, random dataconvergence rateImproved
add restarting (RSPP) to SPP (ablation)SPP · constrained least squares, random dataconvergenceImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy