{"arxiv_id":"2611.17076","title":"Adaptive Constraint Sampling for Stochastic Gradient Methods in Constrained Optimization","abstract":"This paper proposes an adaptive constraint-sampling technique for stochastic gradient-based methods to efficiently solve constrained optimization problems with a large number of inequality constraints. The proposed constraint-sampling technique maintains a set of recently violated constraints and draws the constraint used in each iteration uniformly either from this set or from the set of all constraints. This keeps its per-iteration arithmetic overhead independent of the number of constraints. In simulations on synthetic convex optimization problems and in the synthesis of a control barrier function for the Dubins Car, the constraint-sampling technique is shown to significantly outperform uniform constraint sampling.","primary_cat":"math.OC","cross_cats":[],"submitted_at":"2026-11-12T16:47:50+00:00","latest_version":1,"source":"arxiv","source_label":"arXiv","source_url":null,"has_pdf":true,"has_source":false,"verdict":"CONDITIONAL","confidence":"MODERATE","one_line_summary":"An adaptive constraint-sampling scheme for stochastic gradient methods maintains a working set of recently violated constraints and empirically outperforms uniform sampling on large-scale convex optimization and CBF synthesis.","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","upvotes":0,"downvotes":0,"pith_score":0,"inbound_count":0,"_links":{"html":"https://pith.science/paper/2611.17076","verdict":"/api/v1/verdicts/2611.17076"}}