Prox-PEP achieves O(T^{-1/4}) expected oracle complexity for epsilon-KKT stationarity in weakly convex stochastic nonlinear programming via proximal steps, exact penalty, and designed quadratic subproblems.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
PMQSopt achieves expected O(T^{-1/4}) convergence rates for three epsilon-KKT metrics after T iterations in weakly convex stochastic programming under weak convexity and strict feasibility assumptions.
citing papers explorer
-
Prox-PEP: A Proximal Partial Exact Penalty Algorithm for Weakly Convex Stochastic Nonlinear Programming
Prox-PEP achieves O(T^{-1/4}) expected oracle complexity for epsilon-KKT stationarity in weakly convex stochastic nonlinear programming via proximal steps, exact penalty, and designed quadratic subproblems.
-
A Quadratic-Approximation-Based Stochastic Approximation Method for Weakly Convex Stochastic Programming
PMQSopt achieves expected O(T^{-1/4}) convergence rates for three epsilon-KKT metrics after T iterations in weakly convex stochastic programming under weak convexity and strict feasibility assumptions.