Pages that link to "Item:Q4561227"

The following pages link to Stochastic Methods for Composite and Weakly Convex Optimization Problems (Q4561227):

Displaying 31 items.

• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
• Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces (Q2028468) (← links)
• A zeroth order method for stochastic weakly convex optimization (Q2057220) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (Q2089785) (← links)
• Computation for latent variable model estimation: a unified stochastic proximal framework (Q2103576) (← links)
• Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set (Q2113393) (← links)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• A stochastic subgradient method for distributionally robust non-convex and non-smooth learning (Q2159458) (← links)
• Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization (Q2228354) (← links)
• Stochastic subgradient method converges on tame functions (Q2291732) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set (Q2679007) (← links)
• Characterization of solutions of strong-weak convex programming problems (Q3382765) (← links)
• Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
• A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization (Q4995000) (← links)
• (Q4998940) (← links)
• A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
• Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates (Q5072589) (← links)
• Graphical Convergence of Subgradients in Nonconvex Optimization and Learning (Q5076697) (← links)
• Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty (Q5085157) (← links)
• Pathological Subgradient Dynamics (Q5110559) (← links)
• An Inertial Newton Algorithm for Deep Learning (Q5159400) (← links)
• An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems (Q5162651) (← links)
• Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems (Q5231692) (← links)
• Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity (Q5233106) (← links)
• On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) (← links)
• Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming (Q5869814) (← links)
• Learning with risks based on M-location (Q6097134) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)
• First-order methods for convex optimization (Q6169988) (← links)