{"total":22,"rows":[{"id":"2212.09513","title":"Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization","created":"2022-12-19","cited_by_count":19,"area":null},{"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":"2203.01505","title":"Large-scale Optimization of Partial AUC in a Range of False Positive Rates","created":"2022-03-03","cited_by_count":15,"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.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":"2212.12603","title":"Stochastic Methods for AUC Optimization subject to AUC-based Fairness Constraints","created":"2022-12-23","cited_by_count":9,"area":null},{"id":"2501.19214","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","created":"2025-01-31","cited_by_count":9,"area":null},{"id":"2111.04597","title":"Neyman-Pearson Multi-class Classification via Cost-sensitive Learning","created":"2021-11-08","cited_by_count":6,"area":null},{"id":"2504.15243","title":"Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints","created":"2025-04-21","cited_by_count":6,"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":"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":"2402.09560","title":"Distribution-Free Rates in Neyman-Pearson Classification","created":"2024-02-14","cited_by_count":3,"area":null},{"id":"2210.05108","title":"Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control","created":"2022-10-11","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":"2505.12530","title":"Enforcing Fair Predicted Scores on Intervals of Percentiles by Difference-of-Convex Constraints","created":"2025-05-18","cited_by_count":2,"area":null},{"id":"2308.10767","title":"GBM-based Bregman Proximal Algorithms for Constrained Learning","created":"2023-08-21","cited_by_count":1,"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":"2603.05774","title":"First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints","created":"2026-03-06","cited_by_count":1,"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":"2405.01984","title":"A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints","created":"2024-05-03","cited_by_count":0,"area":null},{"id":"2504.09409","title":"Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization","created":"2025-04-13","cited_by_count":0,"area":null},{"id":"2506.02504","title":"Stochastic Momentum Methods for Non-smooth Non-Convex Finite-Sum Coupled Compositional Optimization","created":"2025-06-03","cited_by_count":0,"area":null}],"next_cursor":null}