An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints
Journal Article
·
· IEEE Transactions on Automatic Control
- Bayer U.S. LLC, St. Louis, MO (United States)
- Rutgers Univ., New Brunswick, NJ (United States)
We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.
- Research Organization:
- Rutgers Univ., Piscataway, NJ (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- Grant/Contract Number:
- SC0023303
- OSTI ID:
- 3009630
- Journal Information:
- IEEE Transactions on Automatic Control, Journal Name: IEEE Transactions on Automatic Control Journal Issue: 12 Vol. 68; ISSN 0018-9286; ISSN 2334-3303; ISSN 1558-2523
- Publisher:
- IEEECopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions
Journal Article
·
Mon Feb 17 19:00:00 EST 2025
· SIAM Journal on Optimization
·
OSTI ID:3009725
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
Journal Article
·
Tue Jul 20 20:00:00 EDT 2021
· Mathematical Programming
·
OSTI ID:1909160
A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions
Journal Article
·
Fri Dec 14 23:00:00 EST 2007
· Applied Mathematics and Optimization
·
OSTI ID:21064181