Abstract
The proximal point algorithm is an iterative method for finding a zero of a maximal monotone set-valued mapping, and has served as a fundamental method for solving Variational Inequality problems and, in particular, convex optimization problems. In this paper, we propose a new variant of the primal-dual proximal point algorithm for solving monotone Variational Inequality problems. The proposed method adopts a Gauss-Seidel-like procedure to solve a subproblem in each iteration, which updates primal variables and dual variables alternatively. We prove the convergence of the proposed method and show that our method is particularly effective for Variational Inequality problems with certain separable structure, such as traffic assignment problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D.P. Bertsekas, “Constrained Optimization and Lagrange Multiplier Methods”, Academic Press, New York, 1982.
D.P. Bertsekas and J.N. Tsitsiklis, “Parallel and Distributed Computation: Numerical Methods”, Prentice Hall, New Jersey, 1989.
S. Dafermos, “Traffic equilibrium and Variational Inequalities,” Transportation Science 14, pp. 42–54, 1980.
M. Fukushima, “Application of the alternating direction method of multipliers to separable convex programming problems,” Computational Optimization and Applications 1, pp. 93–111, 1992.
D. Gabay, “Application of the method of multipliers to Variational Inequalities,” in: M. Fortin and R. Gorwinski eds., “Augmented Lagrangian Methods: Applications to the Numerical Solutions of Boundary-Value Problems”, North-Holland, Amsterdam, pp. 299–331, 1983.
G.H. Golub and CF. Van Loan, “Matrix Computations”, The Johns Hopkins University Press, Baltimore, 1983.
P.T. Harker and J.S. Pang, “Finite-dimensional Variational Inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications,” Mathematical Programming 48, pp. 161–220, 1990.
M. Hestenes, “Multiplier and gradient methods,” Journal of Optimization Theory and Applications 4, pp. 303–320, 1969.
S. Ibaraki, M. Fukushima and T. Ibaraki, “Primal-dual proximal point algorithm for linearly constrained convex programming problems,” Computational Optimization and Applications 1, pp. 207–226, 1992.
T. Ito, M. Fukushima and T. Ibaraki, “An iterative method for Variational Inequalities with application to traffic equilibrium problems,” Journal of the Operations Research Society of Japan 3, pp. 82–104, 1988.
J.M. Mulvey and A. RuszczyĔski, “A diagonal quadratic approximation method for large scale linear programs,” Operations Research Letters 12, pp. 205–215, 1992.
M.J.D. Powell, “A method for nonlinear constraints in minimization problems,” in: R. Fletcher eds., “Optimization”, Academic Press, London, pp. 283–298, 1969.
R.T. Rockafellar, “Augmented Lagrange multiplier functions and duality in non-convex programming,” SIAM Journal on Control 12, pp. 268–285, 1974.
R.T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM Journal on Control and Optimization 14, pp. 877–898, 1976.
R.T. Rockafellar, “Monotone operators and augmented Lagrangian methods in nonlinear programming,” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds., “Nonlinear Programming 3”, Academic Press, New York, pp. 1–25, 1978.
R.T. Rockafellar, “Lagrange multipliers and Variational Inequalities,” in: R.W. Cottle, F. Giannessi, and J.L. Lions eds., “Variational Inequality and Complementarity Problems: Theory and Applications”, Wiley, New York, pp. 330–322, 1980.
P. Tseng, “Application of a splitting algorithm to decomposition in convex programming and Variational Inequalities,” SIAM Journal on Control and Optimization 29, pp. 119–138, 1991.
C. Zhu, “Modified proximal point algorithm for extended linear-quadratic programming,” Computational Optimization and Applications 1, pp. 185–205, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Iwaoka, K.I., Fukushima, M.F., Toshihide, I. (1995). A Primal-Dual Proximal Point Algorithm for Variational Inequality Problems. In: Giannessi, F., Maugeri, A. (eds) Variational Inequalities and Network Equilibrium Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-1358-6_11
Download citation
DOI: https://doi.org/10.1007/978-1-4899-1358-6_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-1360-9
Online ISBN: 978-1-4899-1358-6
eBook Packages: Springer Book Archive