{"total":15,"rows":[{"id":"2505.22825","title":"PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow","created":"2025-05-28","cited_by_count":11,"area":null},{"id":"2502.02446","title":"Towards graph neural networks for provably solving convex optimization problems","created":"2025-02-04","cited_by_count":4,"area":null},{"id":"2510.11227","title":"Enforcing convex constraints in Graph Neural Networks","created":"2025-10-13","cited_by_count":2,"area":null},{"id":"2510.20995","title":"AL-CoLe: Augmented Lagrangian for Constrained Learning","created":"2025-10-23","cited_by_count":2,"area":null},{"id":"2603.02015","title":"CausalWrap: Model-Agnostic Causal Constraint Wrappers for Tabular Synthetic Data","created":"2026-03-02","cited_by_count":2,"area":null},{"id":"2502.02434","title":"mPOLICE: Provable Enforcement of Multi-Region Affine Constraints in Deep Neural Networks","created":"2025-02-04","cited_by_count":1,"area":null},{"id":"2509.22500","title":"Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2601.16510","title":"Learning to Optimize by Differentiable Programming","created":"2026-01-23","cited_by_count":1,"area":null},{"id":"2605.07113","title":"Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2507.07159","title":"Large-scale portfolio optimization with variational neural annealing","created":"2025-07-09","cited_by_count":0,"area":null},{"id":"2510.05451","title":"NASP-T: A Fuzzy Neuro-Symbolic Transformer for Logic-Constrained Aviation Safety Report Classification","created":"2025-10-06","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":"2606.18518","title":"PSyGenTAB: A Privacy-Preserving Framework for Synthetic Clinical Tabular Data Generation via Constrained Optimization","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2609.16282","title":"Scaling Laws for Physics-Aware ACOPF Surrogate Learning","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2609.30088","title":"AT-SKM-Net: An Accelerated Trainable Sampling Kaczmarz-Motzkin Framework for Linear Hard-Constraint Feasibility on Dynamic Graphs","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}