{"total":15,"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":"2303.09261","title":"Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold","created":"2023-03-16","cited_by_count":14,"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":"2301.02060","title":"A first-order augmented Lagrangian method for constrained minimax optimization","created":"2023-01-05","cited_by_count":8,"area":null},{"id":"2301.03139","title":"A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees","created":"2023-01-09","cited_by_count":6,"area":null},{"id":"2410.03955","title":"A Retention-Centric Framework for Continual Learning with Guaranteed Model Developmental Safety","created":"2024-10-04","cited_by_count":4,"area":null},{"id":"2207.05697","title":"A Newton-CG based barrier method for finding a second-order stationary point of nonconvex conic optimization with complexity guarantees","created":"2022-07-12","cited_by_count":2,"area":null},{"id":"2301.04204","title":"A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization","created":"2023-01-10","cited_by_count":2,"area":null},{"id":"2404.09438","title":"Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization","created":"2024-04-15","cited_by_count":2,"area":null},{"id":"2607.08954","title":"Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity","created":"2026-07-09","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":"2310.09999","title":"Outlier Detection Using Generative Models with Theoretical Performance Guarantees","created":"2023-10-16","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},{"id":"2512.22909","title":"A first-order method for nonconvex-strongly-concave constrained minimax optimization","created":"2025-12-28","cited_by_count":0,"area":null},{"id":"2605.29635","title":"MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization","created":"2026-05-28","cited_by_count":0,"area":null}],"next_cursor":null}