arxiv
PublishedJune 1, 2026 at 4:00 AM
Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
Publisher summary· verbatim
arXiv:2601.20076v2 Announce Type: replace-cross Abstract: We consider minimizing an objective function subject to constraints defined by the intersection of lower-level sets of convex functions. We study two cases: (i) strongly convex and Lipschitz-smooth objective function and (ii) convex but possi
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSFMambaNet: Spectral-Frequency Enhanced Selective State Space Model for Correspondence Pruning17harxivOptical-Guided Neural Collapse for SAR Few-Shot Class Incremental Learning17harxivDynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models17harxivTemporal Order Matters for Agentic Memory: Segment Trees for Long-Horizon Agents17hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗