activity
20242026
collaborators

6 papers

math.OC2026

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes

Abhishek Chakraborty, Angelia Nedić

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…

cs.LG2026

Distance-Aware Muon: Adaptive Step Scaling for Normalized Optimization

Yury Demidovich, Abhishek Chakraborty, Grigory Malinovsky +2

Muon and related normalized optimizers decouple the choice of update direction from the choice of step scale, but their practical performance remains sensitive to the scale of the…

math.OC2025

Popov Mirror-Prox Method for Variational Inequalities

Abhishek Chakraborty, Angelia Nedić

This paper establishes the convergence properties of the Popov mirror-prox algorithm for solving stochastic and deterministic variational inequalities (VIs) under a polynomial grow…

math.OC2025

Randomized Feasibility-Update Algorithms for Stochastic Variational Inequality Problems

Abhishek Chakraborty, Angelia Nedić

This paper considers stochastic monotone variational inequalities whose feasible region is the intersection of a (possibly infinite) number of convex functional level sets. A proje…

math.OC2024

Popov Mirror-Prox for solving Variational Inequalities

Abhishek Chakraborty, Angelia Nedić

We consider the mirror-prox algorithm for solving monotone Variational Inequality (VI) problems. As the mirror-prox algorithm is not practically implementable, except in special in…

math.OC2024

Randomized Feasibility-Update Algorithms for Variational Inequality Problems

Abhishek Chakraborty, Angelia Nedić

This paper considers a variational inequality (VI) problem arising from a game among multiple agents, where each agent aims to minimize its own cost function subject to its constra…