{"total":13,"rows":[{"id":"2311.00678","title":"Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints","created":"2023-11-01","cited_by_count":16,"area":null},{"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,"area":null},{"id":"2209.10825","title":"Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis","created":"2022-09-22","cited_by_count":12,"area":null},{"id":"2301.13314","title":"Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization","created":"2023-01-30","cited_by_count":11,"area":null},{"id":"2504.07607","title":"Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints","created":"2025-04-10","cited_by_count":5,"area":null},{"id":"2311.00944","title":"Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization","created":"2023-11-02","cited_by_count":4,"area":null},{"id":"2403.09090","title":"Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimization","created":"2024-03-14","cited_by_count":4,"area":null},{"id":"2311.09065","title":"Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2502.19764","title":"Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2604.04130","title":"Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints","created":"2026-04-05","cited_by_count":1,"area":null},{"id":"2307.07605","title":"First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2502.00053","title":"Differentiable Projection-based Learn to Optimize in Wireless Network-Part I: Convex Constrained (Non-)Convex Programming","created":"2025-01-29","cited_by_count":0,"area":null},{"id":"2509.02894","title":"A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints","created":"2025-09-02","cited_by_count":0,"area":null}],"next_cursor":null}