{"list":"other","total":59,"rows":[{"id":"1803.02453","title":"A Reductions Approach to Fair Classification","created":"2018-03-06","cited_by_count":587},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1803.06523","title":"Stochastic model-based minimization of weakly convex functions","created":"2018-03-17","cited_by_count":159},{"id":"1511.06324","title":"Global Convergence of ADMM in Nonconvex Nonsmooth Optimization","created":"2015-11-18","cited_by_count":98},{"id":"1410.1390","title":"Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems","created":"2014-10-06","cited_by_count":64},{"id":"1810.02060","title":"Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learning","created":"2018-10-04","cited_by_count":63},{"id":"1605.00125","title":"Efficiency of minimizing compositions of convex functions and smooth maps","created":"2016-04-30","cited_by_count":59},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39},{"id":"1908.02734","title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","created":"2019-08-07","cited_by_count":38},{"id":"1910.01845","title":"The Complexity of Finding Stationary Points with Stochastic Gradient Descent","created":"2019-10-04","cited_by_count":35},{"id":"1803.02461","title":"Subgradient methods for sharp weakly convex functions","created":"2018-03-06","cited_by_count":33},{"id":"1802.02988","title":"Stochastic subgradient method converges at the rate $O(k^{-1/4})$ on weakly convex functions","created":"2018-02-08","cited_by_count":32},{"id":"2112.09002","title":"On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions","created":"2021-12-16","cited_by_count":31},{"id":"1707.03505","title":"Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems","created":"2017-07-12","cited_by_count":30},{"id":"2007.10525","title":"Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization","created":"2020-07-20","cited_by_count":30},{"id":"1906.11357","title":"An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints","created":"2019-06-26","cited_by_count":29},{"id":"1908.01871","title":"Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints","created":"2019-08-05","cited_by_count":25},{"id":"2102.05320","title":"An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangians","created":"2021-02-10","cited_by_count":25},{"id":"2106.13015","title":"A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear Equality Constrained Optimization with Rank-Deficient Jacobians","created":"2021-06-24","cited_by_count":22},{"id":"2007.01284","title":"Rate-improved Inexact Augmented Lagrangian Method for Constrained Nonconvex Optimization","created":"2020-07-02","cited_by_count":21},{"id":"2112.14799","title":"Worst-Case Complexity of an SQP Method for Nonlinear Equality Constrained Stochastic Optimization","created":"2021-12-29","cited_by_count":19},{"id":"1806.04781","title":"On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimization","created":"2018-06-12","cited_by_count":18},{"id":"2212.00927","title":"First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points","created":"2022-12-02","cited_by_count":17},{"id":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","cited_by_count":17},{"id":"1512.03107","title":"RSG: Beating Subgradient Method without Smoothness and Strong Convexity","created":"2015-12-09","cited_by_count":15},{"id":"1802.03504","title":"Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs","created":"2018-02-10","cited_by_count":15},{"id":"1812.10229","title":"A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization","created":"2018-12-26","cited_by_count":14},{"id":"1605.02408","title":"Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis","created":"2016-05-09","cited_by_count":13},{"id":"2002.04130","title":"Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions","created":"2020-02-10","cited_by_count":13},{"id":"2006.16440","title":"A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization","created":"2020-06-30","cited_by_count":13},{"id":"2207.05650","title":"A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization","created":"2022-07-12","cited_by_count":12},{"id":"2107.03512","title":"Inexact Sequential Quadratic Optimization for Minimizing a Stochastic Objective Function Subject to Deterministic Nonlinear Equality Constraints","created":"2021-07-07","cited_by_count":11},{"id":"1409.8147","title":"Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs","created":"2014-09-29","cited_by_count":10},{"id":"1710.06612","title":"Mirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints","created":"2017-10-18","cited_by_count":10},{"id":"2101.08519","title":"Moreau Envelope Augmented Lagrangian Method for Nonconvex Optimization with Linear Constraints","created":"2021-01-21","cited_by_count":10},{"id":"2106.03034","title":"Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization","created":"2021-06-06","cited_by_count":10},{"id":"2205.08011","title":"Level Constrained First Order Methods for Function Constrained Optimization","created":"2022-05-16","cited_by_count":8},{"id":"2209.10346","title":"On the Complexity of Finding Small Subgradients in Nonsmooth Optimization","created":"2022-09-21","cited_by_count":8},{"id":"2301.00477","title":"A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization","created":"2023-01-01","cited_by_count":8},{"id":"1709.03384","title":"Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity","created":"2017-09-11","cited_by_count":6},{"id":"1802.09592","title":"ADMM for Multiaffine Constrained Optimization","created":"2018-02-26","cited_by_count":6},{"id":"2006.08048","title":"Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems","created":"2020-06-14","cited_by_count":6},{"id":"2008.07080","title":"Iteration-complexity of a proximal augmented Lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints","created":"2020-08-17","cited_by_count":6},{"id":"2207.06304","title":"On the Iteration Complexity of Smoothed Proximal ALM for Nonconvex Optimization Problem with Convex Constraints","created":"2022-07-13","cited_by_count":6},{"id":"1705.07285","title":"Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization","created":"2017-05-20","cited_by_count":5},{"id":"2008.00562","title":"Iteration-complexity of an inner accelerated inexact proximal augmented Lagrangian method based on the classical Lagrangian function","created":"2020-08-02","cited_by_count":5},{"id":"1802.08556","title":"Complexity of finding near-stationary points of convex functions stochastically","created":"2018-02-21","cited_by_count":4},{"id":"1904.09513","title":"On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints","created":"2019-04-20","cited_by_count":4},{"id":"2002.11962","title":"Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex Functions?","created":"2020-02-27","cited_by_count":4},{"id":"2010.12169","title":"A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization","created":"2020-10-23","cited_by_count":4},{"id":"2112.11420","title":"Zeroth-order Optimization for Composite Problems with Functional Constraints","created":"2021-12-21","cited_by_count":4},{"id":"1908.00218","title":"Mirror Descent for Constrained Optimization Problems with Large Subgradient Values","created":"2019-08-01","cited_by_count":3},{"id":"2110.11151","title":"An Accelerated Inexact Dampened Augmented Lagrangian Method for Linearly-Constrained Nonconvex Composite Optimization Problems","created":"2021-10-21","cited_by_count":3},{"id":"2207.11905","title":"An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems","created":"2022-07-25","cited_by_count":3},{"id":"1809.08329","title":"Mirror Descent and Constrained Online Optimization Problems","created":"2018-09-21","cited_by_count":2},{"id":"2003.09147","title":"Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems","created":"2020-03-20","cited_by_count":2},{"id":"2210.05108","title":"Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control","created":"2022-10-11","cited_by_count":2},{"id":"1803.01329","title":"One Mirror Descent Algorithm for Convex Constrained Optimization Problems with non-standard growth properties","created":"2018-03-04","cited_by_count":1},{"id":"2104.07796","title":"Inexact-Proximal Accelerated Gradient Method for Stochastic Nonconvex Constrained Optimization Problems","created":"2021-04-15","cited_by_count":1}],"next_cursor":null}