Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

Journal Article · · IEEE Transactions on Automatic Control
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

References (14)

Robust solution of monotone stochastic linear complementarity problems journal July 2007
Incremental constraint projection methods for variational inequalities journal May 2014
On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems journal July 2017
Distributed nonconvex constrained optimization over time-varying digraphs journal February 2019
Algorithmic Game Theory book September 2007
Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method journal June 2014
A Convergent Incremental Gradient Method with a Constant Step Size journal January 2007
On the Convergence Rate of Incremental Aggregated Gradient Algorithms journal January 2017
Convergence Rate of Incremental Gradient and Incremental Newton Methods journal January 2019
A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints journal January 2021
Engineering and Economic Applications of Complementarity Problems journal January 1997
Incremental Subgradient Methods for Nondifferentiable Optimization journal January 2001
Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm journal June 2011
Bilevel Distributed Optimization in Directed Networks conference May 2021

Similar Records

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities
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

Related Subjects