{"total":24,"rows":[{"id":"2506.00362","title":"FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guarantees","created":"2025-05-31","cited_by_count":21,"area":null},{"id":"2508.10480","title":"Pinet: Optimizing hard-constrained neural networks with orthogonal projection layers","created":"2025-08-14","cited_by_count":19,"area":null},{"id":"2410.06324","title":"Differentiation Through Black-Box Quadratic Programming Solvers","created":"2024-10-08","cited_by_count":10,"area":null},{"id":"2404.13831","title":"Data-Driven Performance Guarantees for Classical and Learned Optimizers","created":"2024-04-22","cited_by_count":5,"area":null},{"id":"2411.02158","title":"Learning Multiple Initial Solutions to Optimization Problems","created":"2024-11-04","cited_by_count":4,"area":null},{"id":"2512.01565","title":"Deep FlexQP: Accelerated Nonlinear Programming via Deep Unfolding","created":"2025-12-01","cited_by_count":4,"area":null},{"id":"2508.00775","title":"Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms","created":"2025-08-01","cited_by_count":3,"area":null},{"id":"2509.05288","title":"Learning to accelerate distributed ADMM using graph neural networks","created":"2025-09-05","cited_by_count":3,"area":null},{"id":"2405.18222","title":"From Learning to Optimize to Learning Optimization Algorithms","created":"2024-05-28","cited_by_count":2,"area":null},{"id":"2410.18794","title":"WARP-LCA: Efficient Convolutional Sparse Coding with Locally Competitive Algorithm","created":"2024-10-24","cited_by_count":2,"area":null},{"id":"2601.07665","title":"Learning to accelerate Krasnosel'skii-Mann fixed-point iterations with guarantees","created":"2026-01-12","cited_by_count":2,"area":null},{"id":"2606.13825","title":"Scalable Deep Unfolding of Conic Optimizers","created":"2026-06-11","cited_by_count":2,"area":null},{"id":"2408.16890","title":"Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search","created":"2024-08-29","cited_by_count":1,"area":null},{"id":"2603.05495","title":"Cheap Thrills: Effective Amortized Optimization Using Inexpensive Labels","created":"2026-03-05","cited_by_count":1,"area":null},{"id":"2604.05640","title":"Parametric Nonconvex Optimization via Convex Surrogates","created":"2026-04-07","cited_by_count":1,"area":null},{"id":"2606.08993","title":"LEAF: A Learning-Enabled ADMM Framework for Accelerated Convex Optimization","created":"2026-06-08","cited_by_count":1,"area":null},{"id":"2410.17259","title":"Large Language Models for Knowledge-Free Network Management: Feasibility Study and Opportunities","created":"2024-10-06","cited_by_count":0,"area":null},{"id":"2507.09050","title":"Learning to Solve Constrained Bilevel Control Co-Design Problems","created":"2025-07-11","cited_by_count":0,"area":null},{"id":"2512.05734","title":"KANFormer for Predicting Fill Probabilities via Survival Analysis in Limit Order Books","created":"2025-12-05","cited_by_count":0,"area":null},{"id":"2602.07581","title":"$\\partial$CBDs: Differentiable Causal Block Diagrams","created":"2026-02-07","cited_by_count":0,"area":null},{"id":"2604.26932","title":"Learning Over-Relaxation Policies for ADMM with Convergence Guarantees","created":"2026-04-29","cited_by_count":0,"area":null},{"id":"2605.05728","title":"WARP: A Benchmark for Primal-Dual Warm-Starting of Interior-Point Solvers","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2607.20769","title":"Memory-Computation Tradeoffs in Semi Amortized Parametric Optimization","created":"2026-07-22","cited_by_count":0,"area":null},{"id":"2607.27389","title":"FunL2O: LLM-Guided Feature Function Design for Learning to Optimize","created":"2026-07-29","cited_by_count":0,"area":null}],"next_cursor":null}