ConEx, a single-loop primal-dual method with constraint extrapolation, achieves best-known convergence rates for convex functional constrained problems, and a proximal point method achieves O(1/ε) complexity to approximate KKT points for nonconvex ones.
M., Ramos, A., and Silva, P
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization
ConEx, a single-loop primal-dual method with constraint extrapolation, achieves best-known convergence rates for convex functional constrained problems, and a proximal point method achieves O(1/ε) complexity to approximate KKT points for nonconvex ones.