Abstract
Global error bounds for possibly degenerate or nondegenerate monotone affine variational inequality problems are given. The error bounds are on an arbitrary point and are in terms of the distance between the given point and a solution to a convex quadratic program. For the monotone linear complementarity problem the convex program is that of minimizing a quadratic function on the nonnegative orthant. These bounds may form the basis of an iterative quadratic programming procedure for solving affine variational inequality problems. A strong upper semicontinuity result is also obtained which may be useful for finitely terminating any convergent algorithm by periodically solving a linear program.
Similar content being viewed by others
References
A. Auslender,Optimisation Méthodes Numériques (Masson, Paris, 1976).
R.W. Cottle and G. Dantzig, Complementary pivot theory of mathematical programming, Lin. Alg. Appl. 1 (1968) 103–125.
R.W. Cottle, F. Giannessi and J.-L. Lions,Variational Inequalities and Complementarity Problems: Theory and Applications (Wiley, New York, 1980).
R. De Leone and O.L. Mangasarian, Serial and parallel solution of large scale linear programs by augmented Lagrangian successive overrelaxation, in:Optimization, Parallel Processing and Applications, eds. A. Kurzhanski, K. Neumann and D. Pallaschke, Lecture Notes in Economics and Mathematical Systems 304 (Springer, Berlin, 1988) pp. 103–124.
B.C. Eaves, On quadratic programming, Manag. Sci. 17 (1971) 698–711.
M.C. Ferris and O.L. Mangasarian, Minimum principle sufficiency, Math. Prog. 57 (1992) 1–14.
Z.-Q. Luo and P. Tseng, Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem, SIAM J. Optim. 2 (1992).
O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, New York, 1969).
O.L. Mangasarian, A simple characterization of solution sets of convex programs, Oper. Res. Lett. 7 (1988) 21–26.
O.L. Mangasarian, Error bounds for nondegenerate monotone linear complementarity problems, Math. Prog. 40 (1990) 437–445.
O.L. Mangasarian, Global error bounds for monotone affine variational inequality problems, Lin. Alg. Appl. 174 (1992) 153–164.
O.L. Mangasarian and R. De Leone, Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs, Appl. Math. Optim. 17 (1988) 1–14.
O.L. Mangasarian and T.-H. Shiau, Error bounds for monotone linear complementarity problems, Math. Prog. 36 (1986) 81–89.
K.G. Murty,Linear Complementarity, Linear and Nonlinear Programming (Helderman, Berlin, 1988).
J.S. Pang, Inexact Newton methods for the nonlinear complementarity problem, Math. Prog. 36 (1986) 54–71.
J.S. Pang, A posteriori error bound for the linearly-constrained variational inequality problem, Math. Oper. Res. 12 (1987) 474–484.
Author information
Authors and Affiliations
Additional information
This material is based on research supported by Air Force Office of Scientific Research Grant AFOSR-89-0410 and National Science Foundation Grants CCR-9101801 and CCR-9157632.
Rights and permissions
About this article
Cite this article
Ferris, M.C., Mangasarian, O.L. Error bounds and strong upper semicontinuity for monotone affine variational inequalities. Ann Oper Res 46, 293–305 (1993). https://doi.org/10.1007/BF02023101
Issue Date:
DOI: https://doi.org/10.1007/BF02023101