ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization

Abstract

We develop a stochastic trust-region algorithm for minimizing the sum of a Lipschitz-smooth but possibly nonconvex function and a convex but possibly nonsmooth function. Such a problem class arises in many applications, including data science, operations research, and PDE-constrained optimization. This algorithm, which we call ProxSTORM, generalizes STORM [15,11]-a stochastic trust-region algorithm for the unconstrained optimization of smooth functions-and the inexact deterministic proximal trust-region algorithm in [5]. In the absence of a nonsmooth term, we recover the original STORM algorithm, moreover, we improve and simplify certain aspects of STORM analysis, while maintaining STORM martingale framework arguments to prove global convergence and an expected complexity bound. We demonstrate ProxSTORM capabilities on neural network training and topology optimization under uncertainty.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…