BIBLIOGRAPHY - uniroma1.itfacchinei/VICPbib.pdf · 2002-11-18 · Bibliography 3 [32] M. Anitescu,...

BIBLIOGRAPHY

[1] H.Z. Aashtiani and T.L. Magnanti. Equilibria on a congested transportation

network. SIAM Journal on Algebraic and Discrete Methods 2 (1981) 213–226.

[2] H.Z. Aashtiani and T.L. Magnanti. A linearization and decomposition al-

gorithm for computing urban traffic equilibria. Proceedings of the 1982 IEEE

International Large Scale Systems Symposium (1982) pp. 8–19.

[3] J. Abadie. On the Kuhn-Tucker theorem. In J. Abadie, editor, Nonlinear Pro-

gramming, North Holland (Amsterdam 1967) pp. 19–36.

[4] J. Abadie. Generalized reduced gradient and global Newton methods. In R.

Conti, E.D. Giorgi, and F. Giannessi editors, Optimization and Related Fields,

Springer-Verlag (Berlin) pp. 1–20.

[5] M. Aganagic. Variational inequalities and generalized complementarity prob-

lems. Technical Report SOL 78-11, Systems Optimization Laboratory, Depart-

ment of Operations Research, Stanford University (Stanford 1978).

[6] M. Aganagic and R.W. Cottle. A note on Q-matrices. Mathematical Pro-

gramming 16 (1979) 374–377.

[7] B.H. Ahn. Computation of Market Equilibria for Policy Analysis: The Project

Independence Evaluation Study (PIES) Approach, Garland (New York 1979).

[8] B.H. Ahn. A Gauss-Seidel iteration method for nonlinear variational inequality

problems over rectangles. Operations Research Letters 1 (1982) 117–120.

[9] B.H. Ahn and W.W. Hogan. On convergence of the PIES algorithm for com-

puting equilibria. Operations Research 30 (1982) 281–300.

[10] A.M. Al-Fahed and P.D. Panagiotopoulos. Multifingered frictional robot

grippers: a new type of numerical implementation. Computers & Structures 42

(1992) 555-562.

[11] A.M. Al-Fahed, G.E. Stavrolakis, and P.D. Panagiotopoulos. Hard and

soft fingered robot grippers. The linear complementarity approach. Zeitschrift

fur Angewandte Mathematik und Mechanik 71 (1991) 257-265.

[12] P. Alart and A. Curnier. A mixed formulation for frictional contact prob-

lems prone to Newton like solution methods. Computer Methods in Applied

Mechanics and Engineering 92 (1991) 353–375.

[13] E. Allgower and K. Georg. Simplicial and continuation methods for approx-

imating fixed points and solutions to systems of equations. SIAM Review 22

(1980) 28–85.

[14] E. Allgower and K. Georg. Numerical Continuation Methods: An Introduc-

tion, Springer-Verlag (Berlin 1990).

[15] E. Altman, K. Avrachenkov, and C. Barakat. TCP network calculus: the

case of large delay-bandwidth product. Paper presented at the IEEE Infocom

2002 Conference.

1

2 Bibliography

[16] A. Ambrosetti and G. Prodi. A Primer of Nonlinear Analysis, Cambridge

University Press (Cambridge 1993).

[17] E.D. Andersen and Y. Ye. On a homogeneous algorithm for a monotone com-

plementarity problem with nonlinear equality constraints. In M.C. Ferris and

J.S. Pang, editors, Complementarity and Variational Problems: State of the

Art, SIAM Publications (Philadelphia 1997) pp. 1–11.

[18] E.J. Anderson and S.Y. Wu. The continuous complementarity problem. Op-

timization 22 (1991) 419–426.

[19] L.E. Andersson and A. Klarbring. Quasi-static frictional contact of discrete

mechanical structures, European Journal of Mechanics A/Solids 19 (2000) S61–

S78.

[20] R. Andreani, A. Friedlander, and J.M. Martinez. Solution of finite-

dimensional variational inequalities using smooth optimization with simple

bounds. Journal of Optimization Theory and Applications 94 (1997) 635–657.

[21] R. Andreani, A. Friedlander, and S.A. Santos. On the resolution of the

generalized nonlinear complementarity problem. SIAM Journal on Optimization

12 (2002) 303–321.

[22] R. Andreani and J.M. Martinez. Solving complementarity problems by means

of a new smooth constrained nonlinear solver. In M. Fukushima and L. Qi, edi-

tors, Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smooth-

ing Methods, Kluwer Academic Publishers (Dordrecht 1999) pp. 1–24.

[23] R. Andreani and J.M. Martinez. Reformulation of variational inequalities on

a simplex and compactification of complementarity problems. SIAM Journal on

Optimization 10 (2000) 878–895.

[24] R. Andreani and J.M. Martinez. On the solution of bounded and unbounded

mixed complementarity problems. Optimization 50 (2001) 265–278.

[25] R. Andreani, J.M. Martinez, and B. Svaiter. On the regularization of mixed

complementarity problems. Numerical Functional Analysis and Optimization 21

(2000) 589–600.

[26] M. Anitescu. Degenerate nonlinear programming with a quadratic growth con-

dition. SIAM Journal on Optimization 10 (2000) 1116–1135.

[27] M. Anitescu. On solving mathematical programs with complementarity con-

straints as nonlinear programs. Preprint ANL/MCS 864-200, Mathematics and

Computer Science Division, Argonne National Laboratory (2000).

[28] M. Anitescu, J.F. Cremer, and F. Potra. On the existence of solutions to

complementarity formulations of contact problems with friction. In M.C. Ferris

and J.S. Pang, editors, Complementarity and Variational Problems: State of

the Art, SIAM Publications (Philadelphia 1997) pp. 12–21.

[29] M. Anitescu, G. Lesaja, and F.A. Potra. Equivalence between different for-

mulations of the linear complementarity problem. Optimization Methods and

Software 7 (1997) 265–290.

[30] M. Anitescu, G. Lesaja, and F.A. Potra. An infeasible-interior-point

predictor-corrector algorithm for the P∗-geometric LCP. Applied Mathematics

and Optimization 36 (1997) 203–228.

[31] M. Anitescu and F. Potra. Formulating dynamic multi-rigid-body contact

problems with friction as solvable linear complementarity problems. ASME Non-

linear Dynamics 4 (1997) 231–247.

Bibliography 3

[32] M. Anitescu, F.A. Potra, and D. Stewart. Time-stepping for three-

dimensional rigid-body dynamics. Computer Methods in Applied Mechanics and

Engineering 177 (1999) 183–197.

[33] K.J. Arrow and G. Debreu. Existence of an equilibrium for a competitive

economy. Econometrica 22 (1954) 265–290.

[34] K.J. Arrow, L. Hurwicz, and H. Uzawa. Constraint qualifications in maxi-

mization problems. Naval Research Logistics Quarterly 8 (1961) 175–191.

[35] R. Asmuth. Traffic network equilibrium. Technical Report SOL 78-2, Systems

Optimization Laboratory, Department of Operations Research, Stanford Uni-

versity (Stanford 1978).

[36] R. Asmuth, B.C. Eaves, and E.L. Peterson. Computing economic equilibria

on affine networks with Lemke’s algorithm.Mathematics of Operations Research

4 (1979) 207–214.

[37] J.P. Aubin. Mathematical Methods of Game and Economic Theory, North-

Holland (Amsterdam 1979).

[38] J.P. Aubin. Lipschitz behavior of solutions to convex minimization problems.

Mathematics of Operations Research 9 (1984) 87–111.

[39] J.P. Aubin and I. Ekeland. Applied Nonlinear Analysis, John Wiley (New

York 1984).

[40] J.P. Aubin and H. Frankowska. Set-Valued Analysis, Birkauser (Boston

1990).

[41] G. Auchmuty. Variational principles for variational inequalities. Numerical

Functional Analysis and Optimization 10 (1989) 863–874.

[42] A. Auslender. Resolution numerique d’inegalites variationelles. Comptes Ren-

dus l’Academie des Sciences. Series A et B. 276 (1973) A1063–A1066.

[43] A. Auslender. Optimisation: Methodes Numeriques, Masson (Paris 1976).

[44] A. Auslender. Convergence of stationary sequences for variational inequalities

with maximal monotone operators. Applied Mathematics and Optimization 28

(1993) 161–172.

[45] A. Auslender. How to deal with the unbounded in optimization: Theory and

algorithms. Mathematical Programming 79 (1997) 3–18.

[46] A. Auslender. Asymptotic analysis for penalty and barrier methods in varia-

tional inequalities. SIAM Journal of Control and Optimization 37 (1999) 653–

671.

[47] A. Auslender. On the use of asymptotic functions in numerical methods for

optimization problems and variational inequalities. Manuscript, Departement

de Mathematiques, Universite Lyon I, France (July 2002).

[48] A. Auslender, R. Cominetti, and J.-P. Crouzeix. Convex functions with

unbounded level sets and applications to duality theory. SIAM Journal on Op-

timization 3 (1993) 669–687.

[49] A. Auslender, R. Cominetti, and M. Haddou. Asymptotic analysis of penalty

and barrier methods in convex and linear programming. Mathematics of Oper-

ations Research 22 (1997) 43–62.

[50] A. Auslender and R. Correa. Primal and dual stability results for variational

inequalities. Computational Optimization and Applications 17 (2000) 117–130.

[51] A. Auslender and J.P. Crouzeix. Global regularity theorems. Mathematics

of Operations Research 13 (1988) 243–253.

4 Bibliography

[52] A. Auslender and J.P. Crouzeix. Well behaved asymptotical convex func-

tions. Analyse Non-lineare (1989) 101–122.

[53] A. Auslender and M. Haddou. An interior-proximal method for convex lin-

early constrained problems and its extension to variational inequalities. Math-

ematical Programming 71 (1995) 77-100.

[54] A. Auslender and M. Teboulle. Lagrangian duality and related methods for

variational inequalities. SIAM Journal of Optimization 10 (2000) 1097-1115.

[55] A. Auslender and M. Teboulle. Entropic proximal decomposition methods

for convex programs and variational inequalities. Mathematical Programming

91 (2001) 33–47.

[56] A. Auslender and M. Teboulle. Asymptotic Cones and Functions in Opti-

mization and Variational Inequalities, Springer-Verlag (Heidelberg 2002).

[57] A. Auslender, M. Teboulle, and S. Ben Tiba. Interior proximal and mul-

tiplier methods based on second order homogeneous kernels. Mathematics of

Operations Research 24 (1999) 645–668.

[58] A. Auslender, M. Teboulle, and S. Ben Tiba. A logarithmic-quadratic prox-

imal method for variational inequalities. Computational Optimization and Ap-

plications 12 (1999) 31–40.

[59] S.A. Awoniyi and M.J. Todd. An efficient simplicial algorithm for computing

a zero of a convex union of smooth functions. Mathematical Programming 25

(1983) 83–108.

[60] C. Baiocchi and A. Capelo. Translated by L. Jayakar. Variational and Quasi-

variational Inequalities: Applications to Free Boundary Problems, John Wiley

(Chichester 1984).

[61] A.B. Bakushinskii. A regularization algorithm based on the Newton-

Kantorovich method for solving variational inequalities. USSR Computational

Mathematics and Mathematical Physics 16 (1976) 16–23.

[62] A.B. Bakushinskii. Methods for solving monotonic variational inequalities

based on the principle of iterative regularization. USSR Computational Mathe-

matics and Mathematical Physics 17 (1977) 12–24.

[63] A.B. Bakusinskii and B.T. Poljak. On the solution of variational inequalities.

Soviet Mathematics Doklady 15 (1974) 1705–1710.

[64] H. Bank, J. Guddat, D. Klatte, B. Kummer, and K. Tammer. Non-Linear

Parametric Optimization, Birkhauser Verlag (Basel 1982).

[65] D. Baraff. Issues in computing contact forces for nonpenetrating rigid bodies.

Algorithmica 10 (1993) 292–352.

[66] D. Baraff. Fast contact force computation for nonpenetrating rigid bodies.

Computer Graphics (Proceedings SIGRAPH) 28 (1994) 23–34.

[67] V. Barbu. Optimal Control of Variational Inequalities, Pitman Advanced Pub-

lishing Program (Boston 1984).

[68] M. Bartelt and W. Li. Abadie’s constraint qualification, Hoffman’s error

bounds, and Hausdorff strong unicity. Journal of Approximation Theory 97

(1999) 140–157.

[69] M. Bartelt and W. Li. Exact order of Hoffman’s error bounds for elliptic

quadratic inequalities derived from vector-valued Chebyshev approximation.

Mathematical Programming, Series B 88 (2000) 223–253.

[70] H.H. Bauschke and J.M. Borwein. On projection algorithms for solving con-

vex feasibility problems. SIAM Review 38 (1996) 367–426.

Bibliography 5

[71] H.H. Bauschke and J.M. Borwein. Legendre functions and the method of

random Bregman projections. Journal of Convex Analysis 4 (1997) 27–67.

[72] H.H. Bauschke, J.M. Borwein, and A.S. Lewis. The method of cyclic projec-

tions for closed convex sets in Hilbert space. Recent developments in optimiza-

tion theory and nonlinear analysis (Jerusalem 1995) Contemporary Mathematics

204, American Mathematical Society (Providence 1997) pp. 1–38.

[73] H.H. Bauschke, J.M. Borwein, and W. Li. Strong conical hull intersection

property, bounded linear regularity, Jameson’s property (G), and error bounds

in convex optimization. Mathematical Programming 86 (1999) 135–160.

[74] H.H. Bauschke, J.M. Borwein, and P. Tseng. Bounded linear regularity,

strong CHIP, and CHIP are distinct properties. Journal of Convex Analysis 7

(2000) 395–412.

[75] M.S. Bazaraa, H.D. Sherali, and C.M. Shetty. Nonlinear Programming:

Theory and Algorithms, second edition, John Wiley (New York 1993).

[76] M.H. Belknap, C.H. Chen, and P.T. Harker. A gradient-based method

for analyzing stochastic variational inequalities with one uncertain parameter.

Working Paper 00-03-13, Department of Operations and Information Manage-

ment, University of Philadelphia (2000).

[77] S. Bellavia and M. Maconi. An inexact interior point method for monotone

NCP. Optimization Methods and Software 11 (1999) 211–241.

[78] R.E. Bellman, R.E. Kalaba and J. Lockett. Numerical inversion of the

Laplace transform. Elsevier (New York 1966).

[79] E.G. Belousov. Introduction to Convex Analysis and Integer Programming.

(In Russian). Moscow University Publisher (1977).

[80] E.G. Belousov and D. Klatte. A Frank-Wolfe type theorem for convex poly-

nomial programs. Computational Optimization and Applications 22 (2002) 37–

48.

[81] A. Bensoussan. Points de Nash dans le cas de fontionnelles quadratiques et

jeux differentiels lineaires a N personnes. SIAM Journal on Control 12 (1974)

460–499.

[82] A. Bensoussan. On the theory of option pricing. Acta Applicandae Mathemat-

icae 2 (1984) 139-158.

[83] A. Bensoussan, M. Goursat, and J.L. Lions. Controle impulsionnel et

inequations quasi-variationnelles stationnaires. Comptes Rendus Academie Sci-

ences Paris 276 (1973) 1279–1284.

[84] A. Bensoussan and J.L. Lions. Nouvelle formulation de problemes de controle

impulsionnel et applications. Comptes Rendus Academie Sciences Paris 276

(1973) 1189–1192.

[85] A. Bensoussan and J.L. Lions. Nouvelles methodes en controle impulsionnel.

Applied Mathematics and Optimization 1 (1974) 289–312.

[86] A. Ben-Tal and A. Nemirovskii. On polyhedral approximations of the second-

order cone. Mathematics of Operations Research 26 (2001) 193–205.

[87] A. Ben-Tal and A. Nemirovskii. Lectures on Modern Convex Optimiza-

tion: Analysis, Algorithms, and Engineering Applications, SIAM Publications

(Philadelphia 2001).

[88] C. Berge. Topological Spaces, Oliver and Boyd (Edinburgh 1963).

[89] C. Bergthaller and I. Singer. The distance to a polyhedron. Linear Algebra

and its Applications 169 (1992) 111–129.

6 Bibliography

[90] A. Berman. Cones, Matrices, and Mathematical Programming. Lecture Notes

in Economics and Mathematical Systems 79. Springer-Verlay (Berlin 1979).

[91] D. Bernstein and S.A. Gabriel. Solving the nonadditive network equilibrium

problem. In P. Pardalos, D.W. Hearn, and W.W. Hager, editors, Network Opti-

mization, Lecture Notes in Economics and Mathematical Systems 450, Springer-

Verlag (Berlin 1997) pp. 72–102.

[92] D.P. Bertsekas. Nonlinear Programming, second edition, Athena Scientific

(Massachusetts 1999).

[93] D.P. Bertsekas. A note on error bounds for convex and nonconvex programs.

Computational Optimization and Applications 12 (1999) 41–52.

[94] D.P. Bertsekas and E. Gafni. Projection methods for variational inequalities

with application to the traffic assignment problem. Mathematical Programming

Study 12 (1982) 139–159.

[95] D.P. Bertsekas and J.N. Tsitsiklis. Parallel and Distributed Computation,

Numerical Methods, Athena Scientific (Massachusetts 1997).

[96] D.N. Bessis and F.H. Clarke. Partial subdifferentials, derivatives and

Rademacher’s Theorem. Transactions of the American Mathematical Society

351 (1999) 2899–2926.

[97] R. Bhatia. Matrix Analysis, Springer-Verlag (New York 1997).

[98] E. Bierstone and P.D. Milman. Semianalytic and subanalytic sets. Institut

des Hautes Etudes Scientifiques, Publications Mathematiques 67 (1988) 5–42.

[99] S.C. Billups. Algorithms for complementarity problems and generalized equa-

tions. Ph.D. thesis, Computer Science Department, University of Wisconsin,

Madison (1995).

[100] S.C. Billups. Improving the robustness of descent-based methods for semis-

mooth equations using proximal perturbations. Mathematical Programming 87

(2000) 153–175.

[101] S.C. Billups. A homotopy-based algorithm for mixed complementarity prob-

lems. SIAM Journal on Optimization 12 (2002) 583–605.

[102] S.C. Billups and M.C. Ferris. Convergence of an infeasible interior-point al-

gorithm from arbitrary positive starting points. SIAM Journal on Optimization

6 (1996) 316–325.

[103] S.C. Billups and M.C. Ferris. QPCOMP: A quadratic programming based

solver for mixed complementarity problems. Mathematical Programming 76

(1997) 533–562.

[104] S.C. Billups and M.C. Ferris. Solutions to affine generalized equations using

proximal mappings. Mathematics of Operations Research 24 (1999) 219–236.

[105] S.C. Billups, S.P. Dirkse, and M.C. Ferris. A comparison of algorithms for

large scale mixed complementarity problems. Computational Optimization and

Application 7 (1997) 3–26.

[106] S.C. Billups and K.G. Murty. Complementarity problems. Journal of Com-

putational and Applied Mathematics 124 (2000) 303–318.

[107] S.C. Billups, A.L. Speight, and L.T. Watson. Nonmonotone path following

methods for nonsmooth equations and complementarity problems. In M.C. Fer-

ris, O.L. Mangasarian, and J.S. Pang, editors, Complementarity: Applications,

Algorithms, and Extensions, Kluwer Academic Publishers (Dortrecht 2001) pp.

19–42.

Bibliography 7

[108] S.C. Billups and L.T. Watson. A probability-one homotopy algorithm for

nonsmooth equations and complementarity problems. SIAM Journal on Opti-

mization 12 (2002) 606–626.

[109] G. Bjorkman. The solution of large displacement frictionless contact problems

using a sequence of linear complementarity problems. International Journal for

Numerical Methods in Engineering 31 (1991) 1553–1566.

[110] G. Bjorkman. Path following and critical points for contact problems. Compu-

tational Mechanics 10 (1992) 231–246.

[111] G. Bjorkman, A. Klarbring, T. Larsson, M. Ronnqvist, and B. Sjodin.

Sequential quadratic programming for non-linear elastic contact problems. In J.

Herskovits, editor, Structural Optimization 93, The World Congress on Optimal

Design of Structural Systems 2 (1993) pp. 301–308.

[112] F. Black and M. Scholes. The pricing of options and corporate liabilities.

Journal of Political Economy 81 (1973) 647–659.

[113] J.F. Bonnans. Local study of Newton type algorithms for constrained prob-

lems. In S. Dolecki, editor, Lecture Notes in Mathematics 1405, Springer-Verlag

(Berlin 1989) pp. 13–24.

[114] J.F. Bonnans. Rates of convergence of Newton type methods for variational

inequalities and nonlinear programming. Manuscript, INRIA (1990).

[115] J.F. Bonnans. Local analysis of Newton-type methods for variational inequal-

ities and nonlinear programming. Applied Mathematics and Optimization 29

(1994) 161–186.

[116] J.F. Bonnans, R. Cominetti, and A. Shapiro. Sensitivity analysis of opti-

mization problems under second order regularity constraints. Mathematics of


[117] J.F. Bonnans, R. Cominetti, and A. Shapiro. Second order optimality con-

ditions based on parabolic second order tangent sets. SIAM Journal on Opti-

mization 9 (1999) 466–493.

[118] J.F. Bonnans and C.C. Gonzaga. Convergence of interior-point algorithms

for the monotone linear complementarity problem. Mathematics of Operations

Research 21 (1996) 1–25.

[119] J.F. Bonnans and A. Shapiro. Sensitivity analysis of parametrized programs

under cone constraints. SIAM Journal on Control and Optimization 30 (1992)

1409–1422.

[120] J.F. Bonnans and A. Shapiro. Optimization problems with perturbations. A

guided tour. SIAM Review 40 (1998) 202–227.

[121] J.F. Bonnans and A. Shapiro. Perturbation Analysis of Optimization Prob-

lems, Springer-Verlag (New York 2000).

[122] J.F. Bonnans and A. Sulem. Pseudopower expansion of solutions of generalized

equations and constrained optimization problems. Mathematical Programming

70 (1995) 123–148.

[123] K.C. Border. Fixed Point Theorems with Applications to Economics and Game

Theory. Cambridge University Press (Cambridge 1985).

[124] J.M. Borwein. Stability and regular points of inequality systems. Journal of

Optimization Theory and Applications 48 (1986) 9–52.

[125] J.M. Borwein and M.A.H. Dempster. The linear order complementarity prob-

lem. Mathematics of Operations Research 14 (1989) 534–558.

8 Bibliography

[126] J.M. Borwein and A.S. Lewis. Convex Analysis and Nonlinear Optimization.

Theory and Examples, CMS Books in Mathematics/Ouvrages de Mathmatiques

de la SMC, 3. Springer-Verlag (New York 2000).

[127] S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix

Inequalities in System and Control Theory, SIAM Publications (Philadelphia

1994).

[128] L.M. Bregman. The relaxation method of finding the common point of convex

sets and its application to the solution of problems in convex programming.

USSR Computational Mathematics and Mathematical Physics 7 (1967) 200–

217.

[129] M.J. Brennan and E.S. Schwartz. Valuation of American put options. Journal

of Finance 32 (1977) 449–462.

[130] H. Brezis. Operateurs Maximaux Monotones et Semi-Groupes de Contractions

dans les Espaces de Hilbert, North-Holland (Amsterdam 1973).

[131] H. Brezis and A. Haraux. Image d’une somme d’operateurs monotones et

applications. Israel Journal of Mathematics 23 (1976) 165–186.

[132] H. Brezis and M. Sibony. Methodes d’approximation et d’iteration pour les

operateurs monotones. Archive for Rational Mechanics and Analysis 28 (1968)

59–82.

[133] M. Broadie and J. Detemple. American option valuation: New bounds, ap-

proximations, and a comparison of existing methods. Review of Financial Stud-

ies 9 (1996) 1211–1250.

[134] M. Broadie and J. Detemple. The valuation of American options on multiple

assets. Mathematical Finance 7 (1997) 241–286.

[135] M. Broadie and J. Detemple. Recent advances in numerical methods for pric-

ing derivative securities. In L.C.G. Rogers and D. Talay, editors, Numerical

Methods in Finance, Cambridge University Press (1997) pp. 43-66.

[136] B. Brogliato. Nonsmooth Impact Mechanics. Models, Dynamics and Control,

Springer-Verlag (London 1999).

[137] B. Brogliato, A.A. ten Dam, L. Paoli, and M. Abadie. Numerical simulation

of finite dimensional multibody nonsmooth mechanical systems. Manuscript,

Laboratoire d’Automatique de Grenoble (May 2000).

[138] A. Brooke, D. Kendrick, and A. Meeraus. GAMS: A User’s Guide, The

Scientific Press (San Francisco 1988).

[139] C.G. Broyden. On degeneracy in linear complementarity problems. Linear Al-

gebra and its Applications 143 (1991) 99–110.

[140] F. Browder. The solvability of nonlinear functional equations. Duke Mathe-

matical Journal 33 (1963) 557–567.

[141] F.E. Browder. Existence and approximation of solutions of nonlinear varia-

tional inequalities. Proceedings of the National Academy of Sciences 56 (1966)

1080–1086.

[142] R.E. Bruck. An iterative solution of a variational inequality for certain mono-

tone operators in Hilbert space. Bulletin of the American Mathematical Society

81 (1975) 890–892.

[143] R.E. Bruck. Corrigendum to [142]. Bulletin of the American Mathematical

Society 82 (1976) 353.

[144] R.E. Bruck. On the weak convergence of an ergodic iteration for the solution

of variational inequalities for monotone operators in Hilbert space. Journal of

Mathematical Analysis and Applications 61 (1977) 159–164.

Bibliography 9

[145] R.S. Burachik and A.N. Iusem. A generalized proximal point algorithm for the

variational inequality problem in a Hilbert space. SIAM Journal on Optimization

8 (1998) 197–216.

[146] R.S. Burachik and A.N. Iusem. A generalized proximal point algorithm for

the nonlinear complementarity problem. RAIRO Operations Research 33 (1999)

447–479.

[147] R.S. Burachik, A.N. Iusem, and B.F. Svaiter. Enlargement of monotone

operators with applications to variational inequalities. Set-Valued Analysis 5

(1997) 159–180.

[148] S. Burer, R.D.C. Monteiro, and Y. Zhang. Solving a class of semidefinite

programs via nonlinear program. Mathematical Programming, forthcoming.

[149] S. Burer, R.D.C. Monteiro, and Y. Zhang. Interior-point algorithms for

semidefinite programming based on a nonlinear programming formulation. Com-

putational Optimization and Applications 22 (2002) 49–79.

[150] J.V. Burke. On the identification of active constraints II: The nonconvex case.

SIAM Journal on Numerical Analysis 27 (1990) 1081–1102.

[151] J.V. Burke. Calmness and exact penalization. SIAM Journal on Control and

Optimization 29 (1991) 493–497.

[152] J.V. Burke. An exact penalization viewpoint of constrained optimization.

SIAM Journal on Control and Optimization 29 (1991) 968–998.

[153] J.V. Burke and M.C. Ferris. Characterization of solution sets of convex pro-

grams. Operations Research Letters 10 (1991) 57–60.

[154] J.V. Burke and M.C. Ferris. Weak sharp minima in mathematical program-

ming. SIAM Journal on Control and Optimization 31 (1993) 1340–1359.

[155] J.V. Burke and J.J. More. On the identification of active constraints. SIAM

Journal on Numerical Analysis 25 (1988) 1197–1211.

[156] J.V. Burke and J.J. More. Exposing constraints. SIAM Journal on Optimiza-

tion 4 (1994) 573–595.

[157] J.V. Burke and P. Tseng. A unified analysis of Hoffman’s bound via Fenchel

duality. SIAM Journal on Optimization 6 (1996) 265–282.

[158] J.V. Burke and S. Xu. The global linear convergence of a non-interior path-

following algorithm for linear complementarity problems. Mathematics of Op-

erations Research 23 (1998) 719–734.

[159] J.V. Burke and S. Xu. A non-interior predictor-corrector path-following al-

gorithm for LCP. In M. Fukushima and L. Qi, editors, Reformulation: Nons-

mooth, Piecewise Smooth, Semismooth and Smoothing Methods, Kluwer Aca-

demic Publishers (Dordrecht 1999) pp. 45–63.

[160] J.V. Burke and S. Xu. A non-interior predictor-corrector path following al-

gorithm for the monotone linear complementarity problem. Mathematical Pro-

gramming 87 (2000) 113-130.

[161] J.V. Burke and S. Xu. The complexity of a non-interior path following method

for the linear complementarity problem. Journal of Optimization Theory and

Applications 112 (2002) 53–76.

[162] P.H. Calamai and J.J. More. Projected gradient method for linearly con-

strained problems. Mathematical Programming 39 (1987) 93–116.

[163] M. Cao and M.C. Ferris. An interior point algorithm for monotone affine

variational inequalities. Journal of Optimization Theory and Applications 83

(1994) 269-283.

10 Bibliography

[164] M. Cao and M.C. Ferris. Lineality removal for copositive-plus normal maps.

Communications on Applied Nonlinear Analysis 2 (1995) 1–10.

[165] M. Cao and M.C. Ferris. A pivotal method for affine variational inequalities.

Mathematics of Operations Research 21 (1996) 44-64.

[166] M. Cao and M.C. Ferris. Pc-matrices and the linear complementarity problem.

Linear Algebra and its Applications 246 (1996) 231–249.

[167] I. Capuzzo Dolcetta. Sistemi complementarita e disequazioni variazionali.

Ph.D. thesis, Department of Mathematics, University of Rome (1972).

[168] I. Capuzzo Dolcetta and U. Mosco. Implicit complementarity problems and

quasi-variational inequalities. In: R.W. Cottle, F. Giannessi, and J.L. Lions,

editors, Variational Inequalities and Complementarity Problems: Theory and

Applications, John Wiley (New York 1980) pp. 75-87.

[169] J. Cardell, C.C. Hitt, and W.W. Hogan. Market power and strategic in-

teraction in electricity networks. Resource and Energy Economics 19 (1997)

109–137.

[170] M. Carey. Integrability and mathematical programming models: a survey and

parametric approach. Econometrica 45 (1977) 1957–1976.

[171] Y. Censor, A.N. Iusem, and S.A. Zenios. An interior point method with

Bregman functions for the variational inequality problem with paramonotone

operators. Mathematical Programming 81 (1998) 373–400.

[172] Y. Censor and A. Lent. An interval row action method for interval convex

programming. Journal of Optimization Theory and Applications 34 (1981) 321–

353.

[173] Y. Censor and S.A. Zenios. Parallel Optimization: Theory, Algorithms and

Applications, Oxford University Press (New York 1997).

[174] D. Chan and J.S. Pang. The generalized quasi-variational inequality problem.


[175] D. Chan and J.S. Pang. Iterative methods for variational and complementarity

problems. Mathematical Programming 24 (1982) 284–313.

[176] R. Chandrasekaran, S.N. Kabadi, and K.G. Murty. Some NP-complete

problems in linear programming. Operations Research Letters 1 (1982) 101–

104.

[177] R.W. Chaney. A general sufficiency theorem for nonsmooth nonlinear program-

ming. Transactions of the American Mathematical Society 276 (1983) 235–245.

[178] R.W. Chaney. Piecewise Ck functions in nonsmooth analysis. Nonlinear Anal-

ysis, Theory, Methods and Applications 15 (1990) 649–660.

[179] G.S. Chao and T.L. Friesz. Spatial price equilibrium sensitivity analysis.

Transportation Research 18B (1984) 423–440.

[180] B. Chen. Error bounds for R0-type and monotone nonlinear complementarity

problems. Journal of Optimization Theory and Applications 108 (2001) 297–316.

[181] B. Chen and X. Chen. Global and local superlinear continuation-smoothing

method for P0+R0 and monotone NCP. SIAM Journal of Optimization 9 (1999)

624–645.

[182] B. Chen and X. Chen. A global linear and local quadratic continuation smooth-

ing method for variational inequalities with box constraints. Computational Op-

timization and Applications 17 (2000) 131–158.

[183] B. Chen, X. Chen, and C. Kanzow. A penalized Fischer-Burmeister NCP

functions. Mathematical Programming 88 (2000) 211–216.

Bibliography 11

[184] B. Chen and P.T. Harker. A non-interior continuation method for linear com-

plementarity problems. SIAM Journal on Matrix Analysis 14 (1993) 1168–1190.

[185] B. Chen and P.T. Harker. A non-interior continuation method for monotone

variational inequalities. Mathematical Programming 69 (1995) 237–253.

[186] B. Chen and P.T. Harker. Smooth approximations to nonlinear complemen-

tarity problems. SIAM Journal of Optimization 7 (1997) 403–420.

[187] B. Chen and N. Xiu. A global linear and local quadratic non-interior con-

tinuation method for nonlinear complementarity problems based on Chen-

Mangasarian smoothing function. SIAM Journal of Optimization 9 (1999) 605–

623.

[188] B. Chen and N. Xiu. Superlinear noninterior one-step continuation method for

monotone LCP in the absence of strict complementarity. Journal of Optimiza-

tion Theory and Application 108 (2001) 317–332.

[189] C.H. Chen and O.L. Mangasarian. Smoothing methods for convex inequalities

and linear complementarity problems. Mathematical Programming 71 (1995)

51–69.

[190] C.H. Chen and O.L. Mangasarian. A class of smoothing functions for non-

linear and mixed complementarity problems. Computational Optimization and


[191] G. Chen and M. Teboulle. Convergence analysis of a proximal-like opti-

mization algorithm using Bregman functions. SIAM Journal on Optimization

3 (1993) 538–543.

[192] G.H. Chen and R.T. Rockafellar. Convergence rates in forward-backward

splitting. SIAM Journal on Optimization 7 (1997) 421–444.

[193] X. Chen. Smoothing methods for complementarity problems and their applica-

tions: A survey. Journal of the Operations Research Society of Japan 43 (2000)

32–47.

[194] X. Chen, Z. Nashed, and L. Qi. Convergence of Newton’s method for singular

smooth and nonsmooth equations using adaptive outer inverses. SIAM Journal

on Optimization 7 (1997) 445–462.

[195] X. Chen, Z. Nashed, and L. Qi. Smoothing methods and semismooth methods

for nondifferentiable operator equations. SIAM Journal on Numerical Analysis

38 (2000) 1200–1216.

[196] X. Chen, L. Qi, and D. Sun. Global and superlinear convergence of the smooth-

ing Newton method and its application to general box constrained variational

inequalities. Mathematics of Computation 67 (1998) 519–540.

[197] X. Chen, D. Sun, and J. Sun. Smoothing Newton’s methods and numerical

solution to second order cone complementarity problems. Technical report, De-

partment of Decision Sciences, National University of Singapore (2001).

[198] X. Chen and P. Tseng. Non-interior continuation methods for solving semidef-

inite complementarity problems. Mathematical Programming, forthcoming.

[199] X. Chen and Y. Ye. On homotopy-smoothing methods for variational inequal-

ities. SIAM Journal on Control and Optimization 37 (1999) 589–616.

[200] X. Chen and Y. Ye. On smoothing methods for the P0 matrix linear comple-

mentarity problem. SIAM Journal on Optimization 11 (2000) 341–363.

[201] M.J. Chien and E.S. Kuh. Solving piecewise linear equations for resistive net-

works. Circuit Theory and Applications 3 (1976) 3–24.

12 Bibliography

[202] S.C. Choi, W.S. DeSarbo, and P.T. Harker. Product positioning under price

competition. Management Science 36 (1990) 175–199.

[203] C.C. Chou, K.F. Ng, and J.S. Pang. Minimizing and stationary sequences of

optimization problems. SIAM Journal on Control and Optimization 36 (1998)

1908–1936.

[204] P.W. Christensen. A semismooth Newton method for elastoplastic contact

problems. International Journal of Solids and Structures 39 (2002) 2323–2341.

[205] P.W. Christensen, A. Klarbring, J.S. Pang, and N. Stromberg. Formula-

tion and comparison of algorithms for frictional contact problems. International

Journal for Numerical Methods in Engineering 42 (1998) 145–173.

[206] P.W. Christensen and J.S. Pang. Frictional contact algorithms based on

semismooth Newton methods. In M. Fukushima and L. Qi, editors, Reformu-

lation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods,

Kluwer Academic Publishers (Dordrecht 1999) pp. 81–116.

[207] F.H. Clarke. Optimization and Nonsmooth Analysis, John Wiley (New York

1983).

[208] G. Cohen. Auxiliary problem principle extended to variational inequalities.

Journal of Optimization Theory and Applications 59 (1988) 325–333.

[209] M.Z. Cohen and G. Maier, editors. Engineering Plasticity by Mathematical

Programming. NATO Advanced Study Institute, Pregamon Press (New York

1979).

[210] T.F. Coleman, Y. Li, and A. Verma. A Newton method for American option

pricing. Technical Report CT9907, Cornell Theory Center, Cornell University

(New York 1999).

[211] T.F. Coleman, Y. Li, and A. Verma. Reconstructing the unknown local

volatility function. The Journal of Computational Finance 2 (1999) 77–102.

[212] C. Comi and G. Maier. Extremum theorem and convergence criterion for an

iterative solution to the finite-step problem in elastoplasticity with mixed non-

linear hardening. European Journal Mechanics A/Solids 9 (1990) 563–585.

[213] A.R. Conn, N.I.M. Gould, and Ph. Toint. Trust-Region Methods. SIAM

Publications (Philadelphia 2000).

[214] W. Cook, A.M.H. Gerards, A. Schrijver, and E. Tardos. Sensitivity the-

orems in integer linear programming. Mathematical Programming 34 (1986)

251–264.

[215] A.P. Costa, I.N. Figueiredo, J.A.C. Martins, and J. Judice. A complemen-

tarity eigenproblem in the stability analysis of finite-dimensional elastic systems

with frictional contact. In M.C. Ferris, J.S. Pang, and O.L. Mangasarian, editors.

Complementarity: Applications, Algorithms, and Extensions, Kluwer Academic

Publishers (New York 2001) pp. 67–83.

[216] R.W. Cottle. Nonlinear Programs with Positively Bounded Jacobians. Ph.D.

thesis, Department of Mathematics, University of California, Berkeley (1964).

[217] R.W. Cottle. Note on a fundamental theorem in quadratic programming. Jour-

nal of the Society of Industrial and Applied Mathematics. 12 (1964) 663–665.

[218] R.W. Cottle. Nonlinear programs with positively bounded Jacobians. Journal

of the Society for Industrial and Applied Mathematics 14 (1966) 147–158.

[219] R.W. Cottle. Complementarity and variational problems. Symposia Mathe-

matica 19 (1976) 177–208.

Bibliography 13

[220] R.W. Cottle and G.B. Dantzig. Complementary pivot theory in mathemat-

ical programming. In G.B. Dantzig and A.F. Veinott, Jr., editors, Mathematics

of the Decision Sciences, Part 1., American Mathematical Society, Providence

(1968) pp. 115–136.

[221] R.W. Cottle and G.B. Dantzig. A generalization of the linear complemen-

tarity problem. Journal of Combinatorial Theory 8 (1970) 79–90.

[222] R.W. Cottle, F. Giannessi, and J.L. Lions, editors. Variational Inequalities

and Complementarity Problems: Theory and Applications, John Wiley (New

York 1980).

[223] R.W. Cottle, J.S. Pang, and R.E. Stone. The Linear Complementarity Prob-

lem, Academic Press (Boston 1992).

[224] R.W. Cottle, J.S. Pang, and V. Venkateswaran. Sufficient matrices and the

linear complementarity problem. Linear Algebra and its Applications 114/115

(1989) 231–249.

[225] R.W. Cottle and A.F. Veinott, Jr. Polyhedral sets having a least element.

Mathematical Programming 3 (1972) 238–249.

[226] G.E. Coxson. The P matrix problem is co-NP complete. Mathematical Pro-

gramming 64 (1994) 173–178.

[227] J.P. Crouzeix. Pseudomonotone variational inequality problems: existence of

solutions. Mathematical Programming 78 (1997) 305–314.

[228] J.P. Crouzeix. Characterizations of generalized convexity and generalized

monotonicity, a survey. In J.P. Crouzeix, J.E. Martinez-Legaz, and M. Volle,

editors, [Proceedings of the 5th International Symposium on Generalized Con-

vexity held in Luminy, June 17–21, 1996], Nonconvex Optimization and its

Applications 27, Kluwer Academic Publishers (Dordrecht 1998) pp. 237–256.

[229] J.P. Crouzeix, P. Marcotte, and D. Zhu. Conditions ensuring the applicabil-

ity of cutting-plane methods for solving variational inequalities. Mathematical

Programming 88 (2000) 521–539.

[230] Y. Cui and B. He. A class of projection and contraction methods for asymmetric

linear variational inequalities and their relations to Fukushima’s descent method.

Computers and Mathematics with Applications 38 (1999) 151–164.

[231] A. Curnier and P. Alart. A generalized Newton method for contact prob-

lems with friction. Journal de Mcanique Thorique et Applique, Special Issue :

Numerical Method in Mechanics of Contact Involving Friction (1988) 67–82.

[232] A. Curnier, Q.C. He, and A. Klarbring. Continuum mechanics modelling of

large deformation contact with friction. In M. Raous, M. Jean and J. J. Moreau,

editors, Contact Mechanics, Plenum Press (New York 1995) 145–158.

[233] S.C. Dafermos. Traffic equilibrium and variational inequalities. Transportation

Science 14 (1980) 42–54.

[234] S.C. Dafermos. An iterative scheme for variational inequalities. Mathematical

Programming 26 (1983) 40–47.

[235] S.C. Dafermos. Sensitivity analysis in variational inequalities. Mathematics of


[236] S.C. Dafermos. Exchange price equilibria and variational inequalities. Mathe-

matical Programming 46 (1990) 391–402.

[237] S.C. Dafermos and S.C. McKelvey. Partitionable variational inequalities with

applications to network and economic equilibria. Journal of Optimization The-

ory and Applications 73 (1992) 243–268.

14 Bibliography

[238] S.C. Dafermos and A. Nagurney. General spatial economic equilibrium prob-

lem. Operations Research 32 (1984) 1069–1086.

[239] S.C. Dafermos and A. Nagurney. Sensitivity analysis for the asymmetric

network equilibrium problem. Mathematical Programming 28 (1984) 174–184.

[240] H. Dan, N. Yamashita, and M. Fukushima. A superlinear convergent algo-

rithm for the monotone nonlinear complementarity problem without unique-

ness and nondegeneracy condition. Technical Report 2001-004, Department of

Applied Mathematics and Physics, Kyoto University (April 2001).

[241] J.M. Danskin. The theory of min-max with applications. SIAM Journal on

Applied Mathematics 14 (1966) 641–664.

[242] G.B. Dantzig and A.S. Manne. A complementarity algorithm for an optimal

capital path with invariant proportions. Journal of Economic Theory 9 (1974)

312-323.

[243] M.H.A. Davis and T. Zariphopoulou. American options and transaction fees.

In M.H.A. Davis, D. Duffie, W.H. Fleming, and S.E. Shreve, editors, Mathe-

matical Finance, IMA Volumes in Mathematics and its Applications, # 165,

Springer-Verlag (Berlin 1995) pp. 47–61.

[244] O. Daxhelet and Y. Smeers. Variational inequality models of restructured

electricity systems. In M.C. Ferris, O.L. Mangasarian, and J.S. Pang, editors,

Complementarity: Applications, Algorithms and Extensions, Kluwer Academic

Publishers (Dordrecht 2001) pp. 85–120.

[245] G. Debreu. Theory of Values, Yale University Press (New Haven 1959).

[246] J.P. Dedieu Approximate solutions of analytic inequality systems. SIAM Jour-

nal on Optimization 11 (2000) 411–425.

[247] J.P. Dedieu. Penalty functions in subanalytic optimization. Optimization 26

(1992) 27–32.

[248] J.C. De Bremaecker, M.C. Ferris, and D. Ralph. Compressional fractures

considered as contact problems and mixed complementarity problems. Engineer-

ing Fracture Mechanics 66 (2000) 287–303.

[249] K. Deimling. Nonlinear Functional Analysis, Springer-Verlag (Berlin 1985).

[250] M. De Luca and A. Maugeri. Quasi-variational inequalities and applications

to the traffic equilibrium problem–Discussion of a paradox. Journal of Compu-

tational and Applied Mathematics 28 (1989) 163–171.

[251] T. De Luca, F. Facchinei, and C. Kanzow. A semismooth equation approach

to the solution of nonlinear complementarity problems. Mathematical Program-

ming 75 (1996) 407–439.

[252] T. De Luca, F. Facchinei, and C. Kanzow. A theoretical and numerical com-

parison of some semismooth algorithm for complementarity problems. Compu-

tational Optimization and Applications 16 (2000) 173–205.

[253] S. Dempe. Directional differentiability of optimal solutions under Slater’s con-

dition. Mathematical Programming 59 (1993) 49-69.

[254] M.A.H. Dempster and J.P. Hutton. Fast numerical valuation of American,

exotic and complex options. Applied Mathematical Finance 4 (1997) 1–20.

[255] M.A.H. Dempster and J.P. Hutton. Pricing American stock options by linear

programming. Mathematical Finance 9 (1999) 229–254.

[256] V.F. Demyanov, G. Di Pillo, and F. Facchinei. Exact penalization via Dini

and Hadamard conditional derivatives. Optimization Methods and Software 9

(1998) pp. 19–36.

Bibliography 15

[257] V.F. Demyanov and A.B. Pevnyi. Numerical methods for finding saddle

points. USSR Computational Mathematics and Mathematical Physics 12 (1972)

11–52.

[258] B. De Moor, L. Vandenberghe, and J. Vandewalle. The generalized linear

complementarity problem and an algorithm to find all its solutions. Mathemat-

ical Programming 57 (1992) 415–426.

[259] B. De Schutter and B. De Moor. The extended linear complementarity prob-

lem. Mathematical Programming 71 (1995) 289–325.

[260] B. De Schutter and B. De Moor. Minimal realization in the max algebra is

an extended linear complementarity problem. Systems and Control Letters 25

(1995) 103–111.

[261] B. De Schutter and B. De Moor. The linear dynamic complementarity prob-

lem is a special case of the extended linear complementarity problem. Systems

and Control Letters 34 (1998) 63–75.

[262] R.S. Dembo, S.C. Eisenstat, and T. Steihaug. inexact Newton methods.

SIAM Journal on Numerical Analysis 19 (1982) 400-408.

[263] V.F. Demyanov and A.M. Rubinov. Quasidifferential Calculus, Optimization

Software Inc. (New York 1986).

[264] M. Denault and J.L. Goffin. On a primal-dual analytic center cutting plane

method for variational inequalities. Computational Optimization and Applica-

tions 12 (1999) 127–155.

[265] S. Deng. Computable error bounds for convex inequality systems in reflexive

Banach spaces. SIAM Journal on Optimization 7 (1997) 274–279.

[266] S. Deng. Global error bounds for convex inequality systems in Banach spaces.


[267] S. Deng. Well-posed problems and error bounds in optimization. In M.

Fukushima and L. Qi, editors, Reformulation: Nonsmooth, Piecewise Smooth,

Semismooth and Smoothing Methods, Kluwer Academic Publishers (Dordrecht

1999) pp. 117–126.

[268] S. Deng and H. Hu Computable error bounds for semidefinite programming.

Journal of Global Optimization 14 (1999) 105–115.

[269] J.E. Dennis, S.B. Li, and R.A. Tapia. A unified approach to global convergence

of trust region methods for nonsmooth optimization. Mathematical Program-

ming 68 (1995) 319–346.

[270] J.E. Dennis and J.J. More. A characterization of superlinear convergence

and its applications to quasi-Newton methods. Mathematics of Computation

28 (1974) 549–560.

[271] J.E. Dennis and J.J. More. Quasi-Newton methods. Motivation and theory.

SIAM Review 19 (1977) 46–89.

[272] J.E. Dennis and R.E. Schnabel. Numerical Methods for Unconstrained Opti-

mization and Nonlinear Equations. Prentice-Hall (Englewood Cliffs 1983).

[273] K. Dervis, J. de Melo, and S. Robinson. General Equilibrium Models of

Development Policy. Cambridge University Press (Cambridge 1982).

[274] F. Deutsch, W. Li, and J. Swetits. Fenchel duality and the strong conical

hull intersection property. Journal of Optimization Theory and Applications 102

(1999) 681–695.

[275] J.N. Dewynne, A.E. Whalley, and P. Wilmott. Path-dependent options and

transaction costs. Philosophical Transactions of the Royal Society of London, A

347 (1994) 517–529.

16 Bibliography

[276] J.N. Dewynne and P. Wilmott. Asian options as linear complementarity prob-

lems: analysis and finite-difference solutions. Advances in Futures and Options

Research 8 (1995) 145–173.

[277] G. Di Pillo and L. Grippo. A new class of augmented Lagrangians in nonlinear

programming. SIAM Journal on Control and Optimization 17 (1979) 618–628.

[278] G. Di Pillo and L. Grippo. Exact penalty functions in constrained optimiza-

tion. SIAM Journal on Control and Optimization 27 (1989) 1333–1360.

[279] H. Dietrich. A smooth dual gap function solution to a class of quasivariational

inequalities. Journal of Mathematical Analysis and Applications 235 (1999) 380–

393.

[280] S.P. Dirkse and M.C. Ferris. MCPLIB A collection of nonlinear mixed com-

plementarity problems. Optimization Methods and Software 5 (1995) 319-345.

[281] S.P. Dirkse and M.C. Ferris. The PATH solver: A non-monotone stabiliza-

tion scheme for mixed complementarity problems. Optimization Methods and

Software 5 (1995) 123–156.

[282] S.P. Dirkse and M.C. Ferris. A pathsearch damped Newton method for com-

puting general equilibria. Annals of Operations Research 68 (1996) 211-232.

[283] S.P. Dirkse and M.C. Ferris. Crash techniques for large-scale complemen-

tarity problems. In M.C. Ferris and J.S. Pang, editors, Complementarity and

Variational Problems: State of the Art, SIAM Publications (Philadelphia 1997)

pp. 40-61.

[284] S.P. Dirkse, M.C. Ferris, P.V. Preckel, and T. Rutherford. The GAMS

callable program library for variational and complementarity solvers. Mathe-

matical Programming Technical Report 94-07, Computer Sciences Department,

University of Wisconsin, Madison (June 1994).

[285] S.P. Dokov and A.L. Dontchev. Robinson’s strong regularity implies robust

local convergence of Newton’s method. In W.H. Hager and P.M. Pardalos, edi-

tors. Optimal Control. Theory, algorithms, and applications, Kluwer Academic

Publishers (Dordrecht 1998) pp. 116–129.

Optimal control (Gainesville, Florida 1997), Applied Optimization 15, Kluwer

Academic Publishers (Dordrecht 1998) pp. 116–129.

[286] P Doktor and M. Kucera. Perturbation of a variational inequalities and rate

of convergence of solutions. Czechoslovak Mathematical Journal 30 (1980) 426–

437.

[287] A.L. Dontchev. Implicit function theorems for generalized equations. Mathe-


[288] A.L. Dontchev. Characterizations of Lipschitz stability in optimization. In R.

Lucchetti and J. Revalski, editors, Recent Developments in Well-Posed Varia-

tional Problems. Kluwer Academic Publishers (Dordrecht 1995) pp. 95–115.

[289] A.L. Dontchev Local convergence of the Newton method for generalized equa-

tions. Comptes Rendus des Sances de l’Acadmie des Sciences. Serie I. Mathma-

tique 322 (1996) 327–331.

[290] A.L. Dontchev. Uniform convergence of the Newton method for Aubin con-

tinuous maps. Well-Posedness and Stability of Variational Problems. Serdica

Mathematical Journal 22 (1996) 283–296.

[291] A.L. Dontchev. A proof of the necessity of linear independence condition and

strong second-order sufficient optimality condition for Lipschitzian stability in

nonlinear programming. Journal of Optimization Theory and Applications 98

(1998) 467–473.

Bibliography 17

[292] A.L. Dontchev. Lipschitzian stability of Newton’s method for variational inclu-

sions. System Modelling and Optimization (Cambridge 1999), Kluwer Academic

Publishers (Boston 2000) pp. 119–147.

[293] A.L. Dontchev and W.W. Hager. Lipschitzian stability in nonlinear control

and optimization. SIAM Journal on Control and Optimization 31 (1993) 569–

603.

[294] A.L. Dontchev and W.W. Hager. On Robinson’s implicit function theorems.

Set-Valued Analysis and Differential Inclusions (Pamporovo, 1990), Progress in

Systems and Control Theory 16, Birkhuser (Boston 1993) pp. 75–92.

[295] A.L. Dontchev and W.W. Hager. Implicit functions, Lipschitz maps, and

stability in optimization. Mathematics of Operations Research 19 (1994) 753–

768.

[296] A.L. Dontchev, H.D. Qi, and L. Qi. Convergence of Newton’s method for

convex best interpolation. Numerische Mathematik 87 (2001) 435–456.

[297] A.L. Dontchev and R.T. Rockafellar. Characterizations of strong regular-

ity for variational inequalities over polyhedral convex sets. SIAM Journal on

Optimization 6 (1996) 1087–1105.

[298] A.L. Dontchev and R.T. Rockafellar. Characterizations of Lipschitzian sta-

bility in nonlinear programming. Mathematical Programming with Data Per-

turbations. Lecture Notes in Pure and Applied Mathematics 195, Dekker (New

York 1998) pp. 65–82.

[299] A.L. Dontchev and T. Zolezzi. Well-Posed Optimization Problems. Lecture

Notes in Mathematics 1543, Springer-Verlag (Berlin 1993).

[300] J. Douglas and H.H. Rachford. On the numerical solution of the heat con-

duction problem in 2 and 3 space variables. Transactions of the American Math-

ematical Society 82 (1956) 421–439.

[301] J. Dugundji. Topology, Allyn and Bacon (Boston 1966).

[302] J.C. Dunn. On recursive averaging processes and Hilbert space extensions of

the contraction mapping principle. Journal of the Franklin Institute 295 (1973)

117–133.

[303] J.C. Dunn. Convexity, monotonicity, and gradient processes in Hilbert spaces.

Journal of Mathematical Analysis and Applications 53 (1976) 145–158.

[304] J.C. Dunn. On the convergence of projected gradient processes to a singular

critical points. Journal of Optimization Theory and Applications 56 (1987) 203–

216.

[305] J.C. Dunn. A projected Newton method for minimization problems with non-

linear inequality constraints. Numerische Mathematik 53 (1988) 377–410.

[306] B.C. Eaves. On the basic theorem of complementarity. Mathematical Program-

ming 1 (1971) 68–75.

[307] B.C. Eaves. Computing Kakutani fixed points. SIAM Journal of Applied Math-

ematics 21 (1971) 236–244.

[308] B.C. Eaves. The linear complementarity problem. Management Science 17

(1971) 612–634.

[309] B.C. Eaves. Homotopies for computation of fixed points. Mathematical Pro-

gramming 3 (1972) 1–22.

[310] B.C. Eaves. A short course in solving equations with PL homotopies. In R.W.

Cottle and C.E. Lemke, editors, Nonlinear Programming. SIAM-AMS Proceed-

ings 9, American Mathematical Society (Providence 1976) pp. 73–143.

18 Bibliography

[311] B.C. Eaves. Computing stationary points. Mathematical Programming Study

7 (1978) 1–14.

[312] B.C. Eaves. Computing stationary points, again. In O.L. Mangasarian,

R.R. Meyer, and S.M. Robinson, editors, Nonlinear Programming 3, Academic

Press (New York 1978) pp. 391-405.

[313] B.C. Eaves. Where solving for stationary points by LCPs is mixing Newton

iterates. In B.C. Eaves, F.J. Gould, H.O. Peitgen, and M.J. Todd, editors,

Homotopy Methods and Global Convergence. Plenum Press (New York 1983)

pp. 63–78.

[314] B.C. Eaves. Thoughts on computing market equilibrium with SLCP. The Com-

putation and Modelling of Economic Equilibria (Tilburg, 1985), Contributions

to Economics Analysis 167, North-Holland (Amsterdam 1987) pp. 1–17.

[315] B.C. Eaves, F.J. Gould, H.O. Peitgen, and M.J. Todd, editors, Homotopy

Methods and Global Convergence. Plenum Press (New York 1983).

[316] B.C. Eaves and U. Rothblum. Relationships of properties of piecewise affine

maps over ordered fields. Linear Algebra and its Applications 132 (1990) 1–63.

[317] B.C. Eaves and K. Schmedders. General equilibrium models and homotopy

methods. Journal of Economic Dynamics and Control 23 (1999) 1249–1279.

[318] J. Eckstein. Splitting Methods for Monotone Operators with Applications to

Parallel Optimization. Ph.D. thesis, Laboratory for Information and Decision

Systems, Massachusetts Institute of Technology (1989).

[319] J. Eckstein. Nonlinear proximal point algorithms using Bregman functions,

with applications to convex programming. Mathematics of Operations Research

18 (1993) 202–226.

[320] J. Eckstein. Approximate iterations in Bregman-function-based proximal algo-

rithms. Mathematical Programming 83 (1998) 113–123.

[321] J. Eckstein and D.P. Bertsekas. On the Douglas-Rachford splitting method

and the proximal point algorithm for maximal monotone operators. Mathemat-


[322] J. Eckstein and M.C. Ferris. Operator splitting methods for monotone affine

variational inequalities, with a parallel application to optimal control. IN-

FORMS Journal on Computing 10 (1998) 218–235.

[323] J. Eckstein and M.C. Ferris. Smooth methods of multipliers for complemen-

tarity problems. Mathematical Programming 86 (1999) 65–90.

[324] J. Eckstein and M. Fukushima. Some reformulations and applications of the

alternating direction method of multipliers. In W.W. Hager, D.W. Hearn, and

P.M. Pardalos, editors, Large–Scale Optimization: State of the Art, Kluwer

Academic Publishers (1994) pp. 115–134.

[325] S. Eilenberg and D. Montgomery. Fixed point theorems for multivalued

transformations. American Journal of Mathematics 68 (1946) 214–222.

[326] I. Ekeland. On the variational principle. Journal of Mathematical Analysis and

Applications 47 (1974) 324–354.

[327] I. Ekeland and R. Teman. Analyse Convexe et Probl‘emes Variationnels.

Dunod (Pairs 1974). [English edition: North-Holland (Amsterdam 1976).]

[328] A.S. El Bakry, R.A. Tapia, and Y. Zhang. A study of indicators for identi-

fying zero variables in interior-point methods. SIAM Review 36 (1994) 45–72.

[329] N. El Farouq and G. Cohen. Progressive regularization of variational inequal-

ities and decomposition algorithms. Journal of Optimization Theory and Appli-

cations 97 (1998) 407–433.

Bibliography 19

[330] N. El Farouq. Pseudomonotone variational inequalities: Convergence of prox-

imal methods. Journal of Optimization Theory and Applications 109 (2001)

311–326.

[331] N. El Farouq. Pseudomonotone variational inequalities: Convergence of the

auxiliary problem method. Journal of Optimization Theory and Applications

111 (2001) 305–326.

[332] Y.M. Ermoliev, V.I. Norkin and R.J.-B. Wets. The minimization of semi-

continuous functions: mollifier subgradients. SIAM Journal on Control and Op-

timization 33 (1995) 149–167.

[333] F. Facchinei. On the convergence to a unique point of minimization algorithms.

Technical Report 06-95, Dipartimento di Informatica e Sistemistica, Universita

di Roma “La Sapienza” (Roma 1995).

[334] F. Facchinei. Minimization of SC1 functions and the Maratos effect. Operations

Research Letters 17 (1995) 131–137.

[335] F. Facchinei. Structural and stability properties of P0 nonlinear complemen-

tarity problems. Mathematics of Operations Research 23 (1998) 735–745.

[336] F. Facchinei, A. Fischer, and C. Kanzow. Inexact Newton methods for

semismooth equations with applications to variational inequality problems. In

G. Di Pillo and F. Giannessi, editors, Nonlinear Optimization and Applications,

Plenum Press (New York 1996) pp. 125–139.

[337] F. Facchinei, A. Fischer, and C. Kanzow. A semismooth Newton method

for variational inequalities: the case of box constraints. In M.C. Ferris and J.S.

Pang, editors, Complementarity and variational problems: State of the Art,

SIAM Publications (Philadelphia 1997) pp. 76–90.

[338] F. Facchinei, A. Fischer, and C. Kanzow. Regularity properties of a semis-

mooth reformulation of variational inequalities. SIAM Journal on Optimization

8 (1998) 850-869.

[339] F. Facchinei, A. Fischer, and C. Kanzow. On the accurate identification of

active constraints. SIAM Journal on Optimization 9 (1998) 14–32.

[340] F. Facchinei, A. Fischer, and C. Kanzow. On the identification of zero vari-

ables in an interior-point framework. SIAM Journal on Optimization 10 (2000)

1058–1078.

[341] F. Facchinei, A. Fischer, C. Kanzow, and J.M. Peng. A simply constrained

optimization reformulation of KKT systems arising from variational inequalities.


[342] F. Facchinei and C. Kanzow. On unconstrained and constrained stationary

points of the implicit Lagrangian. Journal of Optimization Theory and Appli-

cations 92 (1997) 99–115.

[343] F. Facchinei and C. Kanzow. A nonsmooth inexact Newton method for the

solution of large-scale nonlinear complementarity problems. Mathematical Pro-

gramming, Series B 76 (1997) 493–512.

[344] F. Facchinei and C. Kanzow. Beyond monotonicity in regularization methods

for nonlinear complementarity problems. SIAM Journal on Control and Opti-

mization 37 (1999) 1150–1161.

[345] F. Facchinei and C. Lazzari. Local feasible QP-free algorithms for the con-

strained minimization of SC1 functions. Technical report 11-00, Dipartimento

di Informatica e Sistemistica, Universita di Roma “La Sapienza” (Roma 2000).

20 Bibliography

[346] F. Facchinei and S. Lucidi. Quadratically and superlinearly convergent algo-

rithms for the solution of inequality constrained minimization problems. Journal

of Optimization Theory and Applications 85 (1995) 265–289.

[347] F. Facchinei and S. Lucidi. Convergence to second order stationary points

in inequality constrained optimization. Mathematics of Operations Research 23

(1998) 746–766.

[348] F. Facchinei and J.S. Pang. Total stability of variational inequalities. Technical

report 09-98, Dipartimento di Informatica e Sistemistica, Universita Degli Studi

di Roma “La Sapienza” (September 1998).

[349] F. Facchinei and J. Soares. Testing a new class of algorithms for nonlinear

complementarity problems. In F. Giannessi and A. Maugeri, editors, Variational

Inequalities and Network Equilibrium Problems, Plenum Press (New York 1995)

pp. 69–83.

[350] F. Facchinei and J. Soares. A new merit function for nonlinear complementar-

ity problems and a related algorithm. SIAM Journal on Optimization 7 (1997)

225–247.

[351] K. Fan. Fixed-point and minimax theorems in locally convex linear spaces.

Proceedings of the National Academy of Sciences U.S.A. 38 (1952) 121–126.

[352] S.C. Fang. An iterative method for generalized complementarity problems.

IEEE Transactions on Automatic Control AC-25 (1980) 1225–1227.

[353] S.C. Fang. Traffic equilibria on multiclass user transportation networks ana-

lyzed via variational inequalities. Tamkang Journal of Mathematics 13 (1982)

1–9.

[354] S.C. Fang. Fixed point models for the equilibrium problems on transportation

networks. Tamkang Journal of Mathematics 13 (1982) 181–191.

[355] S.C. Fang. A linearization method for generalized complementarity problems.

IEEE Transactions on Automatic Control AC29 (1984) 930–933.

[356] S.C. Fang and E.L. Peterson. Generalized variational inequalities. Journal of

Optimization Theory and Application 38 (1982) 363–383.

[357] S.C. Fang and E.L. Peterson. General network equilibrium analysis. Interna-

tional Journal of Systems Sciences 14 (1983) 1249–1257.

[358] S.C. Fang and E.L. Peterson. An economic equilibrium model on a multicom-

modity network. International Journal of Systems Sciences 16 (1985) 479–490.

[359] U. Faraut and A. Koranyi. Analysis on Symmetric Cones, Oxford University

Press (New York 1994).

[360] M.C. Ferris. Weak sharp minima and penalty functions in nonlinear program-

ming. Ph.D. thesis, Churchill College, Cambridge University, United Kingdom

(Cambridge 1989).

[361] M.C. Ferris. Finite termination of the proximal point algorithm.Mathematical

Programming 50 (1991) 359–366.

[362] M.C. Ferris, R. Fourer, and D.M. Gay. Expressing complementarity prob-

lems in an algebraic modeling language and communicating them to solvers.

SIAM Journal on Optimization 9 (1999) 991–1009.

[363] M.C. Ferris, C. Kanzow, and T.S. Munson. Feasible descent algorithms for

mixed complementarity problems. Mathematical Programming 86 (1999) 475–

497.

[364] M.C. Ferris and S. Lucidi. Nonmonotone stabilization methods for nonlinear

equations. Journal of Optimization Theory and Applications 81 (1994) 53–71.

Bibliography 21

[365] M.C. Ferris and O.L. Mangasarian. Minimum principle sufficiency. Mathe-


[366] M.C. Ferris and O.L. Mangasarian. Error bounds and strong upper semi-

continuity for monotone affine variational inequalities. Annals of Operations

Research 47 (1993) 293–305.

[367] M.C. Ferris, O.L. Mangasarian, and J.S. Pang, editors. Complementarity:

Applications, Algorithms and Extensions, Kluwer Academic Publishers (Dor-

drecht 2001).

[368] M.C. Ferris, A. Meeraus, and T.F. Rutherford. Computing Wardropian

equilibria in a complementarity framework. Optimization Methods and Software

10 (1999) 669–685.

[369] M.C. Ferris and T.S. Munson. Interfaces to PATH 3.0: Design, implementa-

tion and usage. Computational Optimization and Applications 12 (1999) 207–

227.

[370] M.C. Ferris and T.S. Munson. Case studies in complementarity: Improving

model formulation. In M. Thera and R. Tichatschke, editors, Ill-Posed Vari-

ational Problems and Regularization Techniques, Lecture Notes in Economics

and Mathematics 477, Springer-Verlag (Berlin 1999) 79–97.

[371] M.C. Ferris and T.S. Munson. Complementarity problems in GAMS and the

PATH solver. Journal of Economic Dynamics and Control 24 (2000) 165–188.

[372] M.C. Ferris and T.S. Munson. Preprocessing complementarity problems. In

M.C. Ferris, O.L. Mangasarian, and J.S. Pang, editors, Complementarity: Ap-

plications, Algorithms and Extensions, Kluwer Academic Publishers (Dordrecht

2001) pp. 143–164.

[373] M.C. Ferris, T.S. Munson, and D. Ralph. A homotopy method for mixed

complementarity problems based on the PATH solver. In D.F. Griffiths and

G.A. Watson, editors, Numerical Analysis 1999, Research Notes in Mathematics,

Chapman and Hall (London 2000) pp. 143–167.

[374] M.C. Ferris and J.S. Pang. Nondegenerate solutions and related concepts in

affine variational inequalities. SIAM Journal on Control and Optimization 34

(1996) 244–263.

[375] M.C. Ferris and J.S. Pang. Engineering and economic applications of com-

plementarity problems. SIAM Review 39 (1997) 669–713.

[376] M.C. Ferris and J.S. Pang, editors. Complementarity and Variational Prob-

lems: State of the Art, SIAM Publications (Philadelphia 1997).

[377] M.C. Ferris and D. Ralph. Projected gradient methods for nonlinear com-

plementarity problems via normal maps. In D. Du, L. Qi, and R. Womersley,

editors, Recent Advances in Nonsmooth Optimization, World Scientific Pub-

lishers (River Ridge 1995) pp. 57–87.

[378] M.C. Ferris and T.F. Rutherford. Accessing realistic complementarity prob-

lems within Matlab. In G. Di Pillo and F. Giannessi, editors, Nonlinear Opti-

mization and Applications, Plenum Press (New York 1996) pp. 141–153.

[379] M.C. Ferris and K. Sinapiromsaran. Formulating and solving nonlinear pro-

grams as mixed complementarity problems. Lecture Notes in Economics and

Mathematical Systems 481 (2000) 132–148.

[380] J.H. Ferziger. Numerical Methods for Engineering Applications. John Wiley

(New York 1981).

[381] A.V. Fiacco. Introduction to Sensitivity and Stability Analysis in Nonlinear

Programming. Academic Press (New York 1983).

22 Bibliography

[382] A.V. Fiacco and G.P. McCormick. Nonlinear Programming: Sequential Un-

constrained Minimization Techniques. John Wiley (New York 1968). [Reprinted

as SIAM Classics in Applied Mathematics 4 (Philadelphia 1990).]

[383] A. Fischer. A special Newton-type optimization method. Optimization 24

(1992) 269–284.

[384] A. Fischer. A Newton-type method for positive-semidefinite linear complemen-

tarity problems. Journal of Optimization Theory and Applications 86 (1995)

585–608.

[385] A. Fischer. On the superlinear convergence of a Newton-type method for LCP

under weak conditions. Optimization Methods and Software 6 (1995) 83–107.

[386] A. Fischer. An NCP-function and its use for the solution of complementar-

ity problems. In D. Du, L. Qi, and R. Womersley, editors, Recent Advances

in Nonsmooth Optimization, World Scientific Publishers (River Ridge 1995)

pp. 88–105.

[387] A. Fischer. Solution of monotone complementarity problems with locally Lip-

schitzian functions. Mathematical Programming, Series B 76 (1997) 513–532.

[388] A. Fischer. New constrained optimization reformulation of complementarity


[389] A. Fischer. Merit functions and stability for complementarity problems. In M.



1999) pp. 149–159.

[390] A. Fischer. Modified Wilson’s method for nonlinear programs with nonunique

multipliers. Mathematics of Operations Research 24 (1999) 699–727.

[391] A. Fischer, V. Jeyakumar, and D.T. Luc. Solution point characterizations

and convergence analysis of a descent algorithm for nonsmooth continuous com-

plementarity problems. Journal of Optimization Theory and Applications 110

(2001) 493–514.

[392] A. Fischer and H. Jiang. Merit functions for complementarity and related

problems: A survey. Computational Optimization and Applications 17 (2000)

159–182.

[393] A. Fischer and C. Kanzow. On finite termination of an iterative method for

linear complementarity problems. Mathematical Programming 74 (1996) 279–

292.

[394] M.L. Fischer and F.J. Gould. A simplicial algorithm for the nonlinear com-

plementarity problem. Mathematical Programming 6 (1974) 281–300.

[395] M.L. Fischer and J.W. Tolle. The nonlinear complementarity problem: ex-

istence and determination of solutions. SIAM Journal of Control and Optimiza-

tion 15 (1977) 612–623.

[396] C.S. Fisk and D. Boyce. Alternative variational inequality formulations of the

equilibrium-travel choice problem. Transportation Science 17 (1983) 454–463.

[397] C.S. Fisk and S. Nguyen. Solution algorithms for network equilibrium models

with asymmetric user costs. Transportation Science 16 (1982) 316–381.

[398] R. Fletcher. Practical Methods of Optimization, second edition, John Wiley

(Chichester 1987).

[399] R. Fletcher, S. Leyffer, D. Ralph, and S. Scholtes. Local convergence

of SQP methods for mathematical programs with equilibrium constraints. Nu-

merical Analysis Report NA/209, Department of Mathematics, University of

Dundee (May 2002).

Bibliography 23

[400] F. Flores-Bazan. Existence theorems for generalized noncoercive equilibrium

problems: The quasi-convex case. SIAM Journal on Optimization 11 (2001)

675–690.

[401] M. Florian. Mathematical programming applications in national, regional, and

urban planning. In M. Iri and K. Tanabe, editors, Mathematical Programming:

Recent Developments and Applications, Kluwer Academic Publishers (Tokyo

1989) pp. 57–82.

[402] M. Florian and M. Los. A new look at static spatial price equilibrium models.

Regional Science and Urban Economics 12 (1982) 579–597.

[403] M. Florian and H. Spiess. The convergence of diagonalization algorithms for

asymmetric network equilibrium problems. Transportation Research, Part B 16

(1982) 477–483.

[404] I. Fonseca and W. Gangbo. Degree Theory in Analysis and Applications,

Oxford University Press (Oxford 1995).

[405] P.A. Forsyth and K.R. Vetzal. Quadratic convergence of a penalty method

for valuing American options. SIAM Journal on Scientific Computing (2002).

[406] M. Fortin and R. Glowinski, editors.Augmented Lagrangian Methods: Appli-

cations to the Numerical Solution of Boundary-Value Problems, North-Holland

(Amsterdam 1983).

[407] R. Fourer, D. Gay, and B. Kernighan. AMPL. The Scientific Press (South

San Francisco 1993).

[408] M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval

Research Logistics Quarterly 3 (1956) 95–110.

[409] A. Friedlander, J.M. Martinez, and S.A. Santos. Solution of linear comple-

mentarity problems using minimization with simple bounds. Journal of Global

Optimization 6 (1995) 1–15.

[410] A. Friedlander, J.M. Martinez, and S.A. Santos. A new strategy for solving

variational inequalities on bounded polytopes. Numerical Functional Analysis


[411] V.M. Friedman and V.S. Chernina. An iterative process for the solution of

the finite-dimensional contact problems. U.S.S.R. Computational Mathematics

and Mathematical Physics 7 (1967) 210–214.

[412] T.L. Friesz. Network equilibrium, design, and aggregation. Transportation Re-

search 19A (1985) 413–427.

[413] T.L. Friesz, D. Bernstein, T.E. Smith, R.L. Tobin, and B.W. Wie. A varia-

tional inequality formulation of the dynamic network user equilibrium problem.


[414] T.L. Friesz, D. Bernstein, and R. Stough. Dynamic systems, variational

inequalities and control theoretic models for predicting urban network flows.

Transportation Science 30 (1996) 14–31.

[415] T.L. Friesz and P.T. Harker. Freight network equilibrium: a review of the

state of the art. In A. Daughety, editor, Analytical Studies in Transportation

Economics, Cambridge University Press (1985) pp. 161–206.

[416] T.L. Friesz, R.L. Tobin, T. Smith, and P.T. Harker. A nonlinear comple-

mentarity formulation and solution procedure for the general derived demand

network equilibrium problem. Journal of Regional Science 23 (1983) 337–359.

[417] T. Fujisawa and E.S. Kuh. Piecewise-linear theory of resistive networks. SIAM

Journal on Applied Mathematics 22 (1972) 307–328.

24 Bibliography

[418] O. Fujiwara, S.P. Han, and O.L. Mangasarian. Local duality of nonlinear

programs. SIAM Journal on Control and Optimization 22 (1984) 162–169.

[419] M. Fukushima. A relaxed projection method for variational inequalities. Math-

ematical Programming 35 (1986) 58–70.

[420] M. Fukushima. Equivalent differentiable optimization problems and descent

methods for asymmetric variational inequality problems. Mathematical Pro-

gramming 53 (1992) 99–110.

[421] M. Fukushima. Merit functions for variational inequality and complementarity

problems. In G. Di Pillo and F. Giannessi, editors, Nonlinear Optimization and

Applications, Plenum Press (New York 1996) pp. 155–170.

[422] M. Fukushima. The primal Douglas-Rachford splitting algorithm for a class of

monotone mappings with application to the traffic equilibrium problem. Math-


[423] M. Fukushima, Z.Q. Luo, and J.S. Pang. A globally convergent sequential

quadratic programming algorithm for mathematical programs with equilibrium

constraints. Computational Optimization and Applications 10 (1998) 5–34.

[424] M. Fukushima, Z.Q. Luo, and P. Tseng. Smoothing functions for second-

order-cone complementarity problems, SIAM Journal on Optimization 12 (2002)

436–460.

[425] M. Fukushima and J.S. Pang. Minimizing and stationary sequences of merit

functions for complementarity problems and variational inequalities. In M.C.

Ferris and J.S. Pang, editors, Complementarity and Variational Problems: State

of the Art, SIAM Publications (Philadelphia 1997) pp. 91–104.

[426] M. Fukushima and J.S. Pang. A penalty approach to generalized Nash equi-

libria, with application to multi-leader-follower games. Manuscript, Department

of Mathematical Sciences, The Johns Hopkins University (June 2002).

[427] M. Fukushima and L. Qi. A globally and superlinearly convergent algorithm

for nonsmooth convex minimization. SIAM Journal on Optimization 30 (1996)

1106–1120.

[428] M. Fukushima and L. Qi, editors. Reformulation: Nonsmooth, Piecewise

Smooth, Semismooth and Smoothing Methods, Kluwer Academic Publishers

(Dordrecht 1999).

[429] D. Gabay. Applications of the method of multipliers to variational inequalities.

In M. Fortin and R. Glowinski, editors, Augmented Lagrangian Methods: Appli-

cations to the Numerical Solution of Boundary-Valkue Problems, North-Holland

(Amsterdam 1983) pp. 299–340.

[430] D. Gabay and H. Moulin. On the uniqueness and stability of Nash equilibria

in noncooperative games. In A. Bensoussan, P. Kleindorfer and C.S. Tapiero,

editors, Applied Stochastic Control in Econometrics and Management Science,

North-Holland (Amsterdam 1980) pp. 271–292.

[431] S.A. Gabriel. An NE/SQP method for the bounded nonlinear complementarity

problem. Journal of Optimization Theory and Applications 97 (1998) 493–506.

[432] S.A. Gabriel. A hybrid smoothing method for mixed nonlinear complementar-

ity problems. Computational Optimization and Applications 9 (1998) 153–173.

[433] S.A. Gabriel and D. Bernstein. The traffic equilibrium problem with nonad-

ditive path costs. Transportation Science 31 (1997) 337–348.

[434] S.A. Gabriel, A.S. Kydes, and P. Whitman. The National Energy Modeling

System: A large-scale energy-economic equilibrium model. Operations Research

49 (2001) 14–25.

Bibliography 25

[435] S.A. Gabriel and J.J. More. Smoothing of mixed complementarity problems.

In M.C. Ferris and J.S. Pang, editors, Complementarity and Variational Prob-

lems: State of the Art, SIAM Publications (Philadelphia 1997) pp. 105–116.

[436] S.A. Gabriel and J.S. Pang. An inexact NE/SQP method for solving the non-

linear complementarity problem. Computational Optimization and Applications

1 (1992) 67–91.

[437] S.A. Gabriel and J.S. Pang. A trust region method for constrained nonsmooth

equations. In W.W. Hager, D.W. Hearn, and P.M. Pardalos, editors, Large–

Scale Optimization: State of the Art, Kluwer Academic Publishers (1994) pp.

159–186.

[438] J.W. Gaddum. A theorem on convex cones with applications to linear inequal-

ities. Proceedings of the American Mathematical Society 3 (1952) 957–960.

[439] E.M. Gafni and D.P. Bertsekas. Two-metric projection methods for con-

strained optimization. SIAM Journal on Control and Optimization 22 (1984)

936–964.

[440] A. Galantai. The theory of Newton’s method. Journal of Computational and


[441] D. Gale and H. Nikaido. The Jacobian matrix and global univalence of map-

pings. Mathematische Annalen 159 (1965) 81–93.

[442] D.Y. Gao. Bi-complementarity and duality: A framework in nonlinear equilibria

with applications to contact problem of elastoplastic beam theory. Journal of

Mathematical Analysis and Applications 221 (1998) 672–697.

[443] C.B. Garcia and W.I. Zangwill. Pathways to Solutions, Fixed Points, and

Equilibria. Prentice–Hall, Inc. (Englewood Cliffs 1981).

[444] M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the

Theory of NP-Completeness. W.H. Freeman (San Francisco 1979).

[445] J. Gauvin. A necessary and sufficient regularity condition to have bounded

multipliers in nonconvex programming. Mathematical Programming 12 (1977)

136–138.

[446] C. Geiger and C. Kanzow. On the resolution of monotone complementarity

problems. Computational Optimization and Applications 5 (1996) 155–173.

[447] V. Ginsburgh and J. Waelbroeck. Activity Analysis and General Equilibrium

Modelling, North–Holland, Amsterdam (1981).

[448] C. Glocker. Formulation of spatial contact situations in rigid multibody sys-

tems. Computer Methods in Applied Mechanics and Engineering 177 (1999)

199–214.

[449] C. Glocker. Spatial friction as standard NCP. Zeitschrift fur Angewandte

Mathematik und Mechanik 81 (2001) S665–S666.

[450] R. Glowinski and P. Le Tallec. Augmented Lagrangian and Operator-

Splitting in Nonlinear Mechanics, SIAM Publications (Philadelphia 1989).

[451] R. Glowinski, J.L. Lions, and R. Tremolieres. Analyse Numerique des

Inequations Variationelles, volumes 1 and 2, Dunod-Bordas (Paris 1976).

[452] D. Goeleven. Noncoercive Variational Problems and Related Problems, Addi-

son Wesley Longman Inc. (1996).

[453] J.L. Goffin, P. Marcotte, and D.L. Zhu. An analytic center cutting plane

method for pseudomonotone variational inequalities. Operations Research Let-

ters 20 (1997) 1–6.

26 Bibliography

[454] B. Gollan. On the marginal function in nonlinear programming. Mathematics


[455] A.J. Goldman and A.W. Tucker. Theory of linear programming. In H.W.

Kuhn and A.W. Tucker, editors, Linear Inequality and Related Systems, Prince-

ton University Press (Princeton 1956) 53–97.

[456] E.G. Golshtein. Method of modification for monotone maps. (In Russian).

Ekonomika i Matematicheskie Metody 11 (1975) 1144–1159 .

[457] E.G. Golshtein and N.V. Tretyakov. Modified Lagrangians in convex pro-

gramming and their generalizations. Mathematical Programming Study 10

(1979) 86–97.

[458] E.G. Golshtein and N.V. Tretyakov. Modified Lagrangians and Monotone

Maps in Optimization, John Wiley (New York 1996). [Translation of Modified

Lagrangian Functions: Theory and Related Optimization Techniques, Nauka

(Moscow 1989).]

[459] M.S. Gowda. Pseudomonotone and copositive-star matrices. Linear Algebra

and its Applications 113 (1989) 107–110.

[460] M.S. Gowda. Complementarity problems over locally compact cones. SIAM

Journal on Control and Optimization 27 (1989) 836–841.

[461] M.S. Gowda. On the continuity of the solution map in linear complementarity

problems. SIAM Journal on Optimization 2 (1992) 619–634.

[462] M.S. Gowda. Applications of degree theory to linear complementarity problems.


[463] M.S. Gowda. An analysis of zero set and global error bound properties of a

piecewise affine function via its recession function. SIAM Journal on Matrix

Analysis and Applications 17 (1996) 594–609.

[464] M.S. Gowda. Inverse and implicit function theorems for H-differentiable and

semismooth functions. Manuscript, Department of Mathematics and Statistics,

University of Maryland Baltimore County (November 2000).

[465] M.S. Gowda and J.S. Pang. On solution stability of the linear complementarity

problem. Mathematics of Operations Research 17 (1992) 77–83.

[466] M.S. Gowda and J.S. Pang. Some existence results for multivalued comple-

mentarity problems. Mathematics of Operations Research 17 (1992) 657–669.

[467] M.S. Gowda and J.S. Pang. Stability analysis of variational inequalities and

nonlinear complementarity problems, via the mixed linear complementarity

problem and degree theory. Mathematics of Operations Research 14 (1994) 831–

879.

[468] M.S. Gowda and J.S. Pang. On the boundedness and stability of solutions to

the affine variational inequality problem. SIAM Journal on Control and Opti-

mization 32 (1994) 421–441.

[469] M.S. Gowda and T. Parthasarathy. Complementarity forms of theorems of

Lyapunov and Stein, and related results. Linear Algebra and its Applications

320 (2000) 131–144.

[470] M.S. Gowda and G. Ravindran. Algebraic univalence theorems for nonsmooth

functions. Journal of Mathematical Analysis and Applications 252 (2000) 917–

935.

[471] M.S. Gowda and T.I. Seidman. Generalized linear complementarity problem.


Bibliography 27

[472] M.S. Gowda and Y. Song. On semidefinite linear complementarity problems.


[473] M.S. Gowda and R. Sznajder. On the Lipschitzian properties of polyhedral

multifunctions. Mathematical Programming 74 (1996) 267–278.

[474] M.S. Gowda and R. Sznajder. On the pseudo-Lipschitzian behavior of the

inverse of a piecewise affine function. In M.C. Ferris and J.S. Pang, editors,

Complementarity and Variational Problems: State of the Art, SIAM Publica-

tions (Philadelphia 1997) pp. 117–131.

[475] M.S. Gowda and R. Sznajder. Weak univalence and connectedness of inverse

images of continuous functions. Mathematics of Operations Research 24 (1999)

255–261.

[476] M.S. Gowda and M.A. Tawhid. Existence and limiting behavior of trajectories

associated with P0-equations. Computational Optimization and Applications 12

(1999) 229–251.

[477] L. Grippo, F. Lampariello, and S. Lucidi. A nonmonotone line search tech-

nique for Newton’s method. SIAM Journal on Numerical Analysis 23 (1986)

707–716.

[478] L. Grippo, F. Lampariello, and S. Lucidi. A class of nonmonotone stabiliza-

tion methods in unconstrained optimization. Numerische Mathematik 59 (1991)

779–805.

[479] B. Grunbaum. Convex Polytopes. John Wiley & Sons, Inc. (New York 1967).

[480] J. Guddat and F.G. Vasquez, with H.Th. Jongen. Parametric Optimization:

Singularities, Pathfollowing and Jumps, John Wiley (Chichester 1990).

[481] O. Guler. On the convergence of the proximal point algorithm for convex min-

imization. SIAM Journal on Control and Optimization 29 (1991) 403–419.

[482] O. Guler. Existence of interior points and interior paths in nonlinear monotone

complementarity problems.Mathematics of Operations Research 18 (1993) 128–

147.

[483] O. Guler. Generalized linear complementarity problems. Mathematics of Op-


[484] O. Guler, A.J. Hoffman, and U.G. Rothblum. Approximations to solutions

to systems of linear inequalities. SIAM Journal on Matrix Analysis and Appli-

cations 16 (1995) 688–696.

[485] O. Guler and Y. Ye. Convergence behavior of interior-point algorithms.Math-


[486] G. Gurkan, A.Y. Ozge, and S.M. Robinson. Sample-path solution of stochas-

tic variational inequalities. Mathematical Programming 84 (1999) 313–333.

[487] J. Gwinner. Generalized Sterling-Newton methods. In W. Oettli and K. Ritter,

editors. Optimization and Operations Research [Lecture Notes in Economics and

Mathematical Systems, Vol. 117], Springer (Berlin 1976) pp. 99–113.

[488] J. Gwinner. On stability for semicoercive variational inequalities applied to

constrained market equilibria and Neumann-Signorini problems. Lecture Notes

in Economics and Mathematical Systems 382, Springer-Verlag (Berlin 1992) pp.

458–477.

[489] C.D. Ha. Stability of the linear complementarity at a solution point. Mathe-


[490] C.D. Ha. Application of degree theory in stability of the complementarity prob-

lem. Mathematics of Operations Research 31 (1987) 327–338.

28 Bibliography

[491] G.J. Habetler and M.M. Kostreva. On a direct algorithm for nonlinear com-

plementarity problems. SIAM Journal on Control and Optimization 16 (1978)

504–511.

[492] G.J. Habetler and A.L. Price. Existence theory for generalized nonlinear

complementarity problems. Journal of Optimization Theory and Applications 7

(1971) 223–239.

[493] W.W. Hager. Lipschitz continuity for constrained process. SIAM Journal on

Control and Optimization 17 (1979) 321–338.

[494] W.W. Hager. Stabilized sequential quadratic programming. Computational

Optimization and Applications 12 (1998) 253–273.

[495] W.W. Hager and M.S. Gowda. Stability in the presence of degeneracy and

error estimation. Mathematical Programming 85 (1999) 181–192.

[496] B.V. Halldorsson and R.H. Tutuncu. An interior-point method for a class

of saddle point problem. Journal of Optimization Theory and Applications,

forthcoming.

[497] A. Hamel. Remarks to an equivalent formulation of Ekeland’s variational prin-

ciple. Optimization 31 (1994) 233–238.

[498] J.H. Hammond and T.L. Magnanti. Generalized descent methods for asym-

metric systems of equations. Mathematics of Operations Research 12 (1987)

678–699.

[499] J. Han and D. Sun. Newton and quasi-Newton methods for normal maps with

polyhedral sets. Journal of Optimization Theory and Applications 94 (1997)

659–676.

[500] S.P. Han and O.L. Mangasarian. Exact penalty functions in nonlinear pro-

gramming. Mathematical Programming 17 (1979) 251–269.

[501] S.P. Han, J.S. Pang, and N. Rangaraj. Globally convergent Newton methods

for nonsmooth equations. Mathematics of Operations Research 17 (1992) 586–

607.

[502] T. Hansen and T.C. Koopmans. On the definition and computation of a capital

stock invariant under optimization. Journal of Economic Theory 5 (1972) 487–

523.

[503] A. Haraux. How to differentiate the projection on a convex set in Hilbert

space. Some applications to variational inequalities. Journal of the Mathematical

Society of Japan 29 (1977) 615–631.

[504] P.T. Harker. A variational inequality approach for the determination of

oligopolistic market equilibrium. Mathematical Programming 30 (1984) 105–

111.

[505] P.T. Harker. Alternative models of spatial competition. Operations Research

34 (1986) 410–425.

[506] P.T. Harker. Predicting Intercity Freight Flows, VNU Science Press (Utrecht

1987).

[507] P.T. Harker. Accelerating the convergence of the diagonalization and pro-

jection algorithms for finite-dimensional variational inequalities. Mathematical

Programming 41 (1988) 29–59.

[508] P.T. Harker. Generalized Nash games and quasivariational inequalities. Euro-

pean Journal of Operations Research 54 (1991) 81–94.

Bibliography 29

[509] P.T. Harker. Lectures on Computation of Equilibria with Equation-Based

Methods: Applications to the Analysis of Service Economics and Operations.

CORE Lecture Series, Universite Catholique de Louvain (Louvain-la-Neuve

1993).

[510] P.T. Harker and J.S. Pang. Finite–dimensional variational inequality and

nonlinear complementarity problems: A survey of theory, algorithms and appli-

cations. Mathematical Programming, Series B 48 (1990) 161–220.

[511] P.T. Harker and B. Xiao. Newton’s method for the nonlinear complementarity

problem: A B-differentiable equation approach. Mathematical Programming,

Series B 48 (1990) 339–358.

[512] P.T. Harker and B. Xiao. A polynomial-time algorithm for affine variational

inequalities. Applied Mathematics Letters 4 (1991) 31–34.

[513] P. Hartman and G. Stampacchia. On some nonlinear elliptic differential func-

tional equations. Acta Mathematica 115 (1966) 153–188.

[514] E. Haynsworth and A.J. Hoffman. Two remarks on copositive matrices. Lin-

ear Algebra and its Applications 2 (1969) 387–392.

[515] B. He. A new method for a class of linear variational inequalities. Mathematical

Programming 66 (1994) 137–144.

[516] B. He. Solving a class of linear projection equations. Numerische Mathematik

68 (1994) 71–80.

[517] B. He. A modified projection and contraction method for a class of linear com-

plementarity problems. Journal of Computational Mathematics 14 (1996) 54–63.

[518] B. He. A class of projection and contraction methods for monotone variational

inequalities. Applied Mathematics and Optimization 35 (1997) 69–76.

[519] B. He. Inexact implicit methods for monotone general variational inequalities.


[520] B. He, L.Z. Liao, and H. Yang. Decomposition method for a class of monotone

variational inequality problems. Journal of Optimization Theory and Applica-

tions 103 (1999) 603–622.

[521] B. He, H. Yang, and S. Wang. Alternating direction method with self-adaptive

penalty parameters for monotone variational inequalities. Journal of Optimiza-

tion Theory and Applications 106 (2000) 337–356.

[522] Y.R. He. Error bounds for nonlinear complementarity problems. Manuscript,

Department of Mathematics, Chinese University of Hong Kong (December

2000).

[523] Y.R. He Minimizing and stationary sequences of convex constrained minimiza-

tion problems. Journal of Optimization Theory and Applications 111 (2001)

137–153.

[524] D.W. Hearn. The gap function of a convex program. Operations Research Let-

ters 1 (1982) 67–71.

[525] D.W. Hearn, S. Lawphongpanich, and S. Nguyen. Convex programming

formulations of the asymmetric traffic assignment problem. Transportation Re-

search, Part B 18 (1984) 357–365.

[526] D.W. Hearn, S. Lawphongpanich, and J.A. Ventura. Restricted simplicial

decomposition: computation and extensions.Mathematical Programming Study

31 (1987) 99–118.

[527] W.P.H. Heemels. Linear Complementarity Systems: A Study in Hybrid Dy-

namics. Ph.D. thesis, Department of Electrical Engineering, Eindhoven Univer-

sity of Technology (November 1999).

30 Bibliography

[528] W.P.M.H. Heemels, J.M. Schumacher, and S. Weiland. The rational com-

plementarity problem. Linear Algebra and its Applications 294 (1999) 93–135.

[529] W.P.M.H. Heemels, J.M. Schumacher, and S. Weiland. Projected dynam-

ical systems in a complementarity formalism. Operations Research Letters 27

(2000) 83–91.

[530] W.P.M.H. Heemels, J.M. Schumacher, and S. Weiland. Linear complemen-

tarity systems. SIAM Journal on Applied Mathematics 60 (2000) 1234–1269.

[531] J.B. Hiriart-Urruty. Refinements of necessary optimality conditions in non-

differentiable programming I. Applied Mathematics and Optimization 5 (1979)

63–82.

[532] J.B. Hiriart-Urruty. Refinements of necessary optimality conditions in nondif-

ferentiable programming II. Mathematical Programming Study 19 (1982) 120–

139.

[533] J.-B. Hiriart-Urruty and C. Lemarechal. Convex Analysis and Minimiza-

tion Algorithms I and II, Springer-Verlag (New York 1993).

[534] J.B. Hiriart-Urruty, J.J. Strodiot, and V.H. Nguyen. Generalized Hessian

matrix and second-order optimality conditions for problems with C1,1 data.


[535] H. Hironaka. Introduction to Real-Analytic Sets and Real-Analytic Maps.

Quaderni dei Gruppi di Ricerca Matematica del Consiglio Nazionale delle

Ricerche. Instituto Matematico “L. Tonelli” dell’Universita di Pisa (Pisa 1973).

[536] H. Hironaka. Subanalytic sets. Number Theory, Algebraic Geometry and Com-

mutative Algebra (1973) 453–393.

[537] I. Hlavacek, J. Haslinger, J. Necas, and J. Lovisek. Solution of Variational

Inequalities in Mechanics, Applied Mathematical Sciences 66, Springer-Verlag,

(New York, 1988).

[538] B.F. Hobbs. Linear complementarity models of Nash-Cournot competition in

bilateral and POOLCO power markets. IEEE Transactions on Power Systems

16 (2001) 194–202.

[539] B.F. Hobbs, C.B. Metzler, and J.S. Pang. Strategic gaming analysis for

electric power networks: An MPEC approach. IEEE Transactions on Power

Systems 15 (2000) 638–645.

[540] A.J. Hoffman. On approximate solutions of systems of linear inequalities. Jour-

nal of Research of the National Bureau of Standards 49 (1952) 263–265.

[541] W.W. Hogan. Energy policy models for project independence. Computers and

Operations Research 2 (1975) 251.

[542] W.W. Hogan. Project independence evaluation system: structure and algo-

rithms. In P.D. Lax, editor, Mathematical Aspects of Production and Distri-

bution of Energy, Proceedings of Symposia in Applied Mathematics, American

Mathematical Society 21 (Providence 1977) pp. 121–137.

[543] T. Hoggard, A.E. Whalley, and P. Wilmott. Hedging option portfolios in

the presence of transaction costs. Advances in Futures and Options Research 7

(1994) 21–35.

[544] R.H.W. Hoppe and H.D. Mittelmann. A multi-grid continuation strategy

for parameter-dependent variational inequalities. Journal of Computational and


[545] L. Hormander. On the division of distributions by polynomials. Arkiv for Math-

ematik 3 (1958) 555–568.

Bibliography 31

[546] R.A. Horn and C. Johnson. Matrix Analysis, Cambridge University Press,

(Cambridge 1985).

[547] R.A. Horn and C. Johnson. Topics in Matrix Analysis, Cambridge University

Press, (Cambridge 1990).

[548] K. Hotta, M. Inaba, and A. Yoshise. A complexity analysis of a smoothing

method using CHKS-functions for monotone linear complementarity problems.

Computational Optimization and Applications 17 (2000) 183–201.

[549] K. Hotta and A. Yoshise. Global convergence of a class of non-interior point

algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear comple-

mentarity problems. Mathematical Programming 86 (1999) 105–133.

[550] H. Hu. Perturbation analysis of global error bounds for systems of linear in-

equalities. Mathematical Programming, Series B 88 (2000) 277–284.

[551] Y. Hu, H.S. Cheng, T. Arai, Y. Kobayashi, and S. Aoyama. Numerical

simulation of piston ring in mixed lubrication–a nonaxisymmetrical analysis.

Journal of Tribology 116 (1994) 470–478.

[552] J. Huang and J.S. Pang. Option pricing and linear complementarity. The Jour-

nal of Computational Finance 2 (1998) 31–60

[553] J. Huang and J.S. Pang. A mathematical programming with equilibrium con-

straints approach to inverse pricing of American options: the case of an implied

volatility surface. The Journal of Computational Finance 4 (2000) 21–56.

[554] L.R. Huang, K.F. Ng, and J.P. Penot. On minimizing and critical sequences

in nonsmooth optimization SIAM Journal on Optimization 10 (2000) 999–1019.

[555] C.M. Ip and J. Kyparisis. Local convergence of quasi-Newton methods for

B-differentiable equations. Mathematical Programming 56 (1992) 71–90.

[556] G. Isac. Complementarity Problems. Lecture Notes in Mathematics 1528,

Springer-Verlag (New York 1992).

[557] G. Isac. A generalization of Karamardian’s condition in complementarity the-

ory. Nonlinear Analysis Forum 4 (1999) 49–63.

[558] G. Isac. Exceptional families of elements, feasibility and complementarity. Jour-

nal of Optimization Theory and Applications 104 (2000) 577–588.

[559] G. Isac, G. V. Bulavski, and V. Kalashnikov. Exceptional families, topolog-

ical degree and complementarity problems. Journal of Global Optimization 10

(1997) 207–225.

[560] G. Isac and A. Carbone. Exceptional families of elements for continuous func-

tions: some applications to complementarity theory. Journal of Global Opti-

mization 15 (1999) 181–196.

[561] G. Isac and M.M. Kostreva. The generalized order complementarity problem.


[562] G. Isac and M.M. Kostreva. The implicit generalized order complementarity

problem and Leontief’s input-output model. Applicationes Mathematicae 24

(1996) 113–125.

[563] V.I. Istratescu. Fixed Point Theory, D. Reidel Publishing Company (Boston

1991).

[564] A.N. Iusem. An interior point method for the nonlinear complementarity prob-

lem. Applied Numerical Mathematics 24 (1997) 469–482.

[565] A.N. Iusem. On some properties of paramonotone operators. Journal of Convex

Analysis 5 (1998) 269–278.

32 Bibliography

[566] A.N. Iusem. On some properties of generalized proximal point methods for

variational inequalities. Journal of Optimization Theory and Applications 96

(1998) 337–362.

[567] A.N. Iusem and B.F. Svaiter. A variant of Korpelevich’s method for variational

inequalities with a new search strategy. Optimization 42 (1997) 309–321.

[568] A.N. Iusem, B.F. Svaiter, and M. Teboulle. Entropy-like proximal methods

in convex programming. Mathematics of Operations Research 19 (1994) 790–

814.

[569] A.F. Izmailov and M.V. Solodov. Error bounds for 2-regular mappings with

Lipschitzian derivatives and their applications. Mathematical Programming 89

(2001) 413–435.

[570] A.F. Izmailov and M.V. Solodov. A new approach to developing superlin-

early convergent algorithms for solving singular equations and reformulations of

complementarity problems. Submitted to SIAM Journal on Optimization (May

2000).

[571] A.F. Izmailov and M.V. Solodov. Karush-Kuhn-Tucker systems: regularity

conditions, error bounds, and a class of Newton-type methods. Submitted to

Mathematical Programming (November 2001).

[572] P. Jaillet, D. Lamberton, and B. Lapeyre. Variational inequalities and the

pricing of American options. Acta Applicandae Mathematicae 21 (1990) 263–

289.

[573] R. Janin. Directional derivative of the marginal function in nonlinear program-

ming. Mathematical Programming Study 21 (1984) 110–126.

[574] B. Jansen, C. Roos, T. Terlaky, and A. Yoshise. Polynomiality of primal-

dual affine scaling algorithms for nonlinear complementarity problems. Mathe-


[575] H. Jiang. Local properties of solutions of nonsmooth variational inequalities.

Optimization 33 (1995) 119–132.

[576] H. Jiang. Unconstrained minimization approaches to nonlinear complementar-

ity problems. Journal of Global Optimization 9 (1996) 169–181.

[577] H. Jiang. Global convergence analysis of the generalized Newton and Gauss-

Newton methods of the Fischer-Burmeister equation for the complementarity

problem. Mathematics of Operations Research 24 (1999) 529–543.

[578] H. Jiang. Potential reduction methods for the nonlinear complementarity prob-

lem. In A. Eberhard, R. Hill, D. Ralph and B.M. Glover, editors, Progress in

Optimization, Kluwer Academic Publishers, (Dordrecht 2000) pp. 177–192.

[579] H. Jiang, M. Fukushima, L. Qi, and D. Sun. A trust region method for solving

generalized complementarity problems. SIAM Journal on Optimization 8 (1998)

140–157.

[580] H. Jiang and L. Qi. Local uniqueness and convergence of iterative methods

for nonsmooth variational inequalities. Journal of Mathematical Analysis and

Applications 196 (1995) 314–331.

[581] H. Jiang and L. Qi. A new nonsmooth equations approach to nonlinear com-

plementarity problems. SIAM Journal on Control and Optimization 35 (1997)

178–193.

[582] H. Jiang, L. Qi, X. Chen, and D. Sun. Semismoothness and superlinear con-

vergence in nonsmooth optimization and nonsmooth equations. In G. Di Pillo

and F. Giannessi, editors, Nonlinear Optimization and Applications, Plenum

Press (New York 1996) pp. 197–212.

Bibliography 33

[583] H. Jiang and D. Ralph. Global and local superlinear convergence analysis

of Newton-type methods for semismooth equations with smooth least-squares.

In M. Fukushima and L. Qi, editors, Reformulation: Nonsmooth, Piecewise

Smooth, Semismooth and Smoothing Methods, Kluwer Academic Publishers

(Dordrecht 1999) pp. 181–210.

[584] K. Jittorntrum. Solution point differentiability without strict complementar-

ity in nonlinear programming.Mathematical Programming Study 21 (1984) 127–

138.

[585] L. Johansson and A. Klarbring. The rigid punch problem with friction using

variational inequalities and linear complementarity. Mechanics of Structures and

Machines 20 (1992) 293–319.

[586] L. Johansson and A. Klarbring. Study of frictional impact using a nonsmooth

equations solver. Journal of Applied Mechanics 67 (2000) 267–273.

[587] C. Jones and M.S. Gowda. On the connectedness of solution sets in linear

complementarity problems. Linear Algebra and its Applications 272 (1998) 33–

44.

[588] P.C. Jones. Computing an optimal invariant capital stock. SIAM Journal on

Algebraic and Discrete Methods 3 (1982) 145–150.

[589] P.C. Jones, G. Morrison, J.C. Swarts, and E.S. Theise. Nonlinear spatial

price equilibrium algorithms: a computational comparison. Microcomputers in

Civil Engineering 3 (1988) 265–271.

[590] P.C. Jones, R. Saigal, and M. Schneider. Computing nonlinear network

equilibria. Mathematical Programming 31 (1985) 57–66.

[591] D.W. Jorgenson and P.J. Wilcoxen. Reducing US carbon emmissions: An

econometric general equilibrium assessment. Resource and Energy Economics

15 (1993) 7–25.

[592] H.Th. Jongen, T. Mobert, J. Ruckmann, and K. Tammer. On inertia and

Schur complement in optimization. Linear Algebra and its Applications 95

(1987) 97–109.

[593] H.Th. Jongen, D. Klatte, and K. Tammer. Implicit functions and sensitivity

of stationary points. Mathematical Programming 49 (1990) 123–138.

[594] N.H. Josephy. Newton’s method for generalized equations. Technical Summary

Report 1965, Mathematics Research Center, University of Wisconsin (Madison

1979).

[595] N.H. Josephy. Quasi-Newton methods for generalized equations. Technical

Summary Report 1966, Mathematics Research Center, University of Wiscon-

sin (Madison 1979).

[596] N.H. Josephy. A Newton method for the PIES energy model. Technical Sum-

mary Report 1977, Mathematics Research Center, University of Wisconsin

(Madison 1979).

[597] F. Jourdan, P. Alart, and M. Jean. A Gauss-Seidel like algorithm to solve

frictional contact problems. Computer Methods in Applied Mechanics and En-

gineering 155 (1998) 31–47.

[598] R.I. Kachurovskii. On monotone operators and convex functionals. (In Rus-

sian). Uspekhi Matematicheskikh Nauk (N.S.) 15 (1960) 213–215.

[599] I. Kaneko. Piecewise linear elastic-plastic analysis. International Journal for

Numerical Methods in Engineering 14 (1979) 757–767.

34 Bibliography

[600] I. Kaneko. Complete solution of a class of elastic-plastic structures. Computer

Methods in Applied Mechanics and Engineering 21 (1980) 193–209.

[601] C. Kanzow. Some equation–based methods for the nonlinear complementarity

problem. Optimization Methods and Software 3 (1994) 327–340.

[602] C. Kanzow. Nonlinear complementarity as unconstrained optimization. Journal


[603] C. Kanzow. Some noninterior continuation methods for linear complementarity

problems. SIAM Journal on Matrix Analysis and Applications 17 (1996) 851–

868.

[604] C. Kanzow An inexact QP-based method for nonlinear complementarity prob-

lems. Numerische Mathematik 80 (1998) 557–577.

[605] C. Kanzow. Global optimization techniques for mixed complementarity prob-

lems. Journal of Global Optimization 16 (2000) 1–21.

[606] C. Kanzow. An active-set-type Newton method for constrained nonlinear sys-

tems. In M.C. Ferris, O.L. Mangasarian, and J.S. Pang, editors, Complemen-

tarity: Applications, Algorithms and Extensions, Kluwer Academic Publishers

(Dordrecht 2001) pp. 179–200.

[607] C. Kanzow. Strictly feasible equation-based methods for mixed complementar-

ity problems. Numerische Mathematik 89 (2001) 135–160.

[608] C. Kanzow and M. Fukushima. Equivalence of the generalized complementar-

ity problem to differentiable unconstrained minimization Journal of Optimiza-


[609] C. Kanzow and M. Fukushima. Solving box constrained variational inequalities

by using the natural residual with D-gap function globalization. Operations

Research Letters 23 (1998) 45–51.

[610] C. Kanzow and M. Fukushima. Theoretical and numerical investigation of

the D-gap function for box constrained variational inequalities. Mathematical

Programming 83 (1998) 55–87.

[611] C. Kanzow and H. Jiang. A continuation method for (strongly) monotone

variational inequalities. Mathematical Programming 81 (1998) 103–125.

[612] C. Kanzow and H. Kleinmichel. A class of Newton-type methods for equality

and inequality constrained optimization. Optimization Methods and Software 5

(1995) 173–198.

[613] C. Kanzow and H. Kleinmichel. A new class of semismooth Newton-type

methods for nonlinear complementarity problems. Computational Optimization

and Applications 11 (1998) 227–251.

[614] C. Kanzow and K. Pieper. Jacobian smoothing methods for nonlinear com-

plementarity problems. SIAM Journal on Optimization 9 (1999) 342–373.

[615] C. Kanzow and H.D. Qi. A QP-free constrained Newton-type method for vari-

ational inequality problems. Mathematical Programming 85 (1999) 81–106.

[616] C. Kanzow, N. Yamashita, and M. Fukushima. New NCP-functions and their

properties. Journal of Optimization Theory and Applications 94 (1997) 115–135.

[617] C. Kanzow and M. Zupke. Inexact trust-region methods for nonlinear com-

plementarity problems. In M. Fukushima and L. Qi, editors, Reformulation:

Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Kluwer

Academic Publishers (Dordrecht 1999) pp. 211–235.

[618] A. Kaplan and R. Tichatschke. Auxiliary problem principle and proximal

point methods. Journal of Global Optimization 17 (2000) 201–224.

Bibliography 35

[619] S. Karamardian. The nonlinear complementarity problem with applications,

part 1. Journal of Optimization Theory and Applications 4 (1969) 87–98.

[620] S. Karamardian. Generalized complementarity problems. Journal of Optimiza-


[621] S. Karamardian. The complementarity problem. Mathematical Programming

2 (1972) 107–129.

[622] S. Karamardian. Complementarity problems over cones with monotone and

pseudomonotone maps. Journal of Optimization Theory and Applications 18

(1976) 445–454.

[623] S. Karamardian. Existence theorem for complementarity problem. Journal of


[624] S. Karamardian (in collaboration with C.B. Garcia), editor. Fixed Points:

Algorithms and Applications, Academic Press (New York 1977).

[625] S. Karamardian and S. Schaible. Seven kinds of monotone maps. Journal of


[626] S. Karamardian, S. Schaible, and J.P. Crouzeix. Characterizations of gen-

eralized monotone maps. Journal of Optimization Theory and Applications 76

(1993) 399–413.

[627] I. Karatzas. On the pricing of American options. Applied Mathematics and


[628] S. Karlin. Mathematical Methods and Theory in Games, Programming, and

Economics. Volume I. Addison-Wesley (Reading 1959).

[629] N. Karmarkar. A new polynomial-time algorithm for linear programming.

Combinatorica 4 (1984) 373–395.

[630] W. Karush. Minima of functions of several variables with inequalities as side

conditions. Masters Thesis, Department of Mathematics, University of Chicago

(1939).

[631] V.Y. Katkovnik. Method of averaging operators in iterative algorithms for

the solution of stochastic extremal problems (In Russian). Kibernetica 4 (1972)

123–131.

[632] J. Katzenelson. An algorithm for solving nonlinear resistive network. Bell Sys-

tem Technical Journal 44 (1965) 1605–1620.

[633] L.G. Khachiyan. A polynomial algorithm in linear programming. Soviet Math-

ematics Doklady 20 (1979) 191–194.

[634] E.N. Khobotov. A modification of the extragradient method for the solution of

variational inequalities and some optimization problems. Zhurnal Vychislitelnoi

Matematiki i Matematicheskoi Fiziki 27 (1987) 1462–1473.

[635] K.C. Kiwiel. Methods of Descent for Nondifferentiable Optimization, Springer-

Verlag (Berlin 1985).

[636] Y.H. Kim and B.M. Kwak. Numerical implementation of dynamic contact anal-

ysis by a complementarity formulation and application to a valve-cotter system

in motorcycle engines.Mechanics of Structures and Machines 28 (2000) 281–301.

[637] D. Kinderlehrer and G. Stampacchia. An Introduction to Variational In-

equalities and Their Applications, Academic Press (New York 1980).

[638] A.J. King and R.T. Rockafellar. Sensitivity analysis for nonsmooth gener-

alized equations. Mathematical Programming 55 (1992) 193–212.

36 Bibliography

[639] A. Klarbring. Contact problems with friction - using a finite dimensional de-

scription and the theory of linear complementarity, Linkoping Studies in Science

and Technology, Thesis No. 20, LIU-TEK-LIC-1984:3.

[640] A. Klarbring. A mathematical programming approach to three dimensional

contact problems with friction. Computer Methods in Applied Mechanics and

Engineering 58 (1986) 175–200.

[641] A. Klarbring. On discrete and discretized non-linear elastic structures in uni-

lateral contact (stability, uniqueness and variational principles). International

Journal on Solids and Structures 24 (1988) 459–479.

[642] A. Klarbring. Derivation and analysis of rate boundary value problems of

frictional contact. European Journal Mechanics A/Solids 9 (1990) 53–85.

[643] A. Klarbring. The rigid punch problem in nonlinear elasticity: formulation,

variational principles and linearization. Journal of Technical Physics 32 (1991)

45–60.

[644] A. Klarbring. Mathematical programming and augmented Lagrangian meth-

ods for frictional contact problems. In A. Curnier, editor, Proceedings Contact

Mechanics International Symposium, Presse Polytechniques et Universitaires

Romandes (Lausanne 1992) pp. 409–422.

[645] A. Klarbring. Mathematical programming in contact problems. In M. H. Ali-

abadi and C. A. Brebbia, editors, Computational Methods for Contact Prob-

lems, Computational Mechanics Publications (Southampton 1993) pp. 233-264.

[646] A. Klarbring. Large displacement frictional contact: a continuum framework

for finite element discretization. European Journal of Mechanics A/Solids 14

(1995) 237–253.

[647] A. Klarbring. On (non-)existence and (non-)uniqueness of solutions. In F.

Pfeiffer and C. Glocker, editors, Frictional Contact Problems, IUTAM Sym-

posium on Unilateral Multibody Dynamics, Kluwer Academic Publisher (Dor-

drecht 1999) pp. 157–168.

[648] A. Klarbring. Contact, friction, discrete mechanical structures and mathemat-

ical programming. In P. Wrigers and P. Panagiotopoulos, editors, New Devel-

opments in Contact Problems (CISM Courses and Lectures No 384), Springer

(Wien 1999) pp. 55-100.

[649] A. Klarbring and G. Bjorkman. A mathematical programming approach

to contact problems with friction and varying contact surface. Computers and

Structures 30 (1988) 1185–1198.

[650] A. Klarbring and G. Bjorkman. Solution of large displacement contact prob-

lems with friction using Newton’s method for generalized equations. Interna-

tional Journal for Numerical Methods in Engineering 34 (1992) 249–269.

[651] A. Klarbring, A. Mikelic, and M. Shillor. Frictional contact problems with

normal compliance. International Journal of Engineering Science 26 (1988) 811–

832.

[652] A. Klarbring and J.S. Pang. Existence of solutions to discrete semicoercive

frictional contact problems. SIAM Journal on Optimization 8 (1998) 414–442.

[653] A. Klarbring and J.S. Pang. The discrete steady sliding problem. Zeitschrift

fur Angewandte Mathematik und Mechanik 79 (1999) 75–90.

[654] D. Klatte. On quantitative stability for C1,1 programs. In R. Durier and C.

Michelot, editors, Recent Developments in Optimization (Dijon, 1994), [Lecture

Notes in Economics and Mathematical Systems 429] Springer Verlag (Berlin

1995), pp. 214–230.

Bibliography 37

[655] D. Klatte. Lipschitz stability and Hoffman’s error bound for convex inequali-

ties. In J. Guddat, H.Th. Jongen, and F. Nozicka, G. Still, and F. Twilt, editors.

Proceedings of the Conference Parametric Optimization and Related Topics IV

(Enschede 1995), Approximation and Optimization 9 (Lang 1997) pp. 201–212.

[656] D. Klatte. Hoffman’s error bound for systems of convex inequalities. In A.V. Fi-

acco, editor, Mathematical Programming with Data Perturbations, Marcel

Dekker Publishers (New York 1998) pp. 185-199.

[657] D. Klatte. Upper Lipschitz behavior of solutions to perturbed C1,1 programs.


[658] D. Klatte and B. Kummer. Strong stability in nonlinear programming revis-

ited. Journal of Australian Mathematical Society B 40 (1999) 336–352.

[659] D. Klatte and B. Kummer. Generalized Kojima functions and Lipschitz sta-

bility of critical points. Computational Optimization and Applications 13 (1999)

61–85.

[660] D. Klatte and B. Kummer. Nonsmooth Equations in Optimization: Regu-

larity, Calculus, Methods and Applications. Kluwer Academic Publishers (Dor-

drecht 2002).

[661] D. Klatte and W. Li. Asymptotic constraint qualifications and global error

bounds for convex inequalities. Mathematical Programming 84 (1999) 137–160.

[662] D. Klatte and K. Tammer. Strong stability of stationary solutions and

Karush-Kuhn-Tucker points in nonlinear programming. Annals of Operations

Research 27 (1990) 285–308.

[663] D. Klatte and G. Thiere A note of Lipschitz constants for solutions of linear

inequalities and equations. Linear Algebra and its Applications 244 (1996) 365–

374.

[664] V. Klee and G.J. Minty. How good is the simplex algorithm? In O. Shisha,

editor, Inequalities, Academic Press (New York 1972) 159–175.

[665] H. Kleinmichel and K. Schonefeld. Newton-type methods for nonlinearly

constrained programming problems–algorithms and theory. Optimization 19

(1988) 397–412.

[666] M. Kocvara and J.V. Outrata. On optimization of systems governed by im-

plicit complementarity problems. Numerical Functional Analysis and Optimiza-

tion 15 (1994) 869–887.

[667] M. Kocvara and J.V. Outrata. On the solution of optimum design problems

with variational inequalities. In D. Du, L. Qi, and R. Womersley, editors, Recent

Advances in Nonsmooth Optimization, World Scientific Publishers (River Ridge

1995) pp. 171–191.

[668] M. Kocvara and J.V. Outrata. On a class of quasi-variational inequalities.

Optimization Methods and Software 5 (1995) 275–295.

[669] M. Kojima. Computational methods for solving the nonlinear complementarity

problem. Keio Engineering Reports 27 (1974) 1–41.

[670] M. Kojima. A unification of the existence theorems of the nonlinear comple-

mentarity problem. Mathematical Programming 9 (1975) 257–277.

[671] M. Kojima. Strongly stable stationary solutions in nonlinear programs. In S.M.

Robinson, editor, Analysis and Computation of Fixed Points, Academic Press

(New York 1980) pp. 93–138.

[672] M. Kojima and R. Hiabayashi. Continuous deformation of nonlinear pro-

grams. Sensitivity, stability, and parametric analysis. Mathematical Program-

ming Study 21 (1984) 150–198.

38 Bibliography

[673] M. Kojima, N. Megiddo, and S. Mizuno. A general framework of continuation

methods for complementarity problems.Mathematics of Operations Research 18

(1993) 945–963.

[674] M. Kojima, N. Megiddo, and T. Noma. Homotopy continuation methods for

nonlinear complementarity problems. Mathematics of Operations Research 16

(1991) 754–774.

[675] M. Kojima, N. Megiddo, T. Noma, and A. Yoshise. A Unified Approach to

Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes

in Computer Science 538, Springer-Verlag (Berlin 1991).

[676] M. Kojima, N. Megiddo, and Y. Ye. An interior point potential reduction

algorithm for the linear complementarity problem. Mathematical Programming

54 (1992) 267–279.

[677] M. Kojima, S. Mizuno, and T. Noma. A new continuation method for com-

plementarity problems with uniform P-functions. Mathematical Programming

43 (1989) 107–113, 1989.

[678] M. Kojima, S. Mizuno, and T. Noma. Limiting behavior of trajectories gener-

ated by a continuation method for monotone complementarity problems. Math-

ematics of Operations Research 15 (1990) 662–675.

[679] M. Kojima, S. Mizuno, and A. Yoshise. A polynomial-time algorithm for a

class of linear complementarity problems.Mathematical Programming 44 (1989)

1–26.

[680] M. Kojima, S. Mizuno, and A. Yoshise. A convex property of monotone com-

plementarity problems. Research report B-267, Department of Information Sci-

ence, Tokyo Institute of Technology, Tokyo (1993).

[681] M. Kojima, H. Nishino, and T. Sekine. An extension of Lemke’s method

to the piecewise linear complementarity problem. SIAM Journal on Applied

Mathematics 31 (1976) 600–613.

[682] M. Kojima, T. Noma, and A. Yoshise. Global convergence in infeasible

interior–point algorithms. Mathematical Programming 65 (1994) 43–72.

[683] M. Kojima, A. Okada, and S. Shindoh. Strongly stable equilibrium points of

N-person noncooperative games.Mathematics of Operations Research 10 (1985)

650–663.

[684] M. Kojima and R. Saigal. A study of PC1 homeomorphisms on subdivided

polyhedra. SIAM Journal on Mathematical Analysis 10 (1979) 1299–1312.

[685] M. Kojima and R. Saigal. On the relationship between conditions that insure

a PL mapping is a homeomorphism. Mathematics of Operations Research 5

(1980) 101–109.

[686] M. Kojima, M. Shida, and S. Shindoh. Reduction of monotone linear comple-

mentarity problems over cones to linear programs over cones. Acta Mathematica

Vietnamica 22 (1997) 147–157.

[687] M. Kojima, M. Shida, and S. Shindoh. Local convergence of predictor-

corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Mathe-


[688] M. Kojima, M. Shida, and S. Shindoh. A predictor-corrector interior-point al-

gorithm for the semidefinite linear complementarity problem using the Alizadeh-

Haeberly-Overton search direction. SIAM Journal on Optimization 9 (1999)

444–465.

Bibliography 39

[689] M. Kojima, M. Shida, and S. Shindoh. Search directions in the SDP and

the monotone SDLCP: generalization and inexact computation. Mathematical

Programming 85 (1999) 51–80.

[690] M. Kojima and S. Shindo. Extensions of Newton and quasi-Newton methods

to systems of PC1 equations. Journal of Operations Research Society of Japan

29 (1986) 352–374.

[691] M. Kojima, S. Shindo, and S. Hara. Interior-point methods for the mono-

tone semidefinite linear complementarity problem in symmetric matrices. SIAM

Journal on Optimization 7 (1997) 86–125.

[692] C.D. Kolstad and L. Mathiesen. Necessary and sufficient conditions for

uniqueness of a Cournot equilibrium. Review of Economic Study 54 (1987) 681–

690.

[693] C.D. Kolstad and L. Mathiesen. Computing Cournot-Nash equilibria. Oper-


[694] I.V. Konnov. Combined relaxation methods for finding equilibrium point and

solving related problems. Russian Mathematics 37 (1993) 46–53.

[695] I.V. Konnov. A class of combined iterative methods for solving variational

inequalities. Journal of Optimization Theory and Applications 94 (1997) 677–

693.

[696] I.V. Konnov. Combined Relaxation Methods for Variational Inequalities.

Springer-Verlag (Berlin 2001).

[697] G.M. Korpelevich. The extragradient method for finding saddle points and

other problems. Ekonomie i Mathematik Metody 12 (1976) 747–756. English

translation: Matecon 13 (1977) 35–49.

[698] M.M. Kostreva. Block pivot methods for solving the complementarity problem.


[699] M.M. Kostreva. Elasto-hydrodynamic lubrication: A non-linear complemen-

tarity problem. International Journal for Numerical Methods in Fluids 4 (1984)

377–397.

[700] M.A. Krasnoselskii. Positive Solutions of Operator Equations. [Translated

from the Russian by R.E. Flaherty, edited by L.F. Boron]. Noordhoff (Groningen

1964).

[701] J. Kreimer and R.Y. Rubinstein. Nondifferentiable optimization via smooth

approximation: general analytical approach. Annals of Operations Research 39

(1992) 97–119.

[702] M.G. Krein and M.A. Rutman. Linear operators leaving invariant a cone in

a Banach space. (In Russian.) Uspekhi Matematicheskikh Nauk (N.S.) 3 (1948)

3–95. [English translation: American Mathematical Society Translation Series I

10 (1962) 199–325.]

[703] J.B. Kruskal. Two convex counterexamples: a discontinuous envelope function

and a non-differentiable nearest point mapping. Proceedings of the American

Mathematical Society 23 (1969) 697–703.

[704] D. Kuhn and R. Lowen. Piecewise affine bijections of IRn, and the equation

Sx+ − Tx− = y. Linear Algebra and its Applications 96 (1987) 109–129.

[705] H.W. Kuhn. Nonlinear programming: A historical view. In R.W. Cottle and

C.E. Lemke, editors, Nonlinear Programming SIAM-AMS Proceedings 9, Amer-

ican Mathematical Society (Providence 1976) pp. 1–26.

40 Bibliography

[706] H.W. Kuhn and A.W. Tucker. Nonlinear programming. In J. Neyman, editor,

Proceedings of the Second Berkeley Symposium on Mathematical Statistics and

Probability, University of California Press (Berkeley 1951) pp. 481-492.

[707] B. Kummer. Newton’s method for non-differentiable functions. In J. Guddat, B.

Bank, H. Hollatz, P. Kall, D. Klatte, B. Kummer, K. Lommatzsch, K. Tammer,

M. Vlach, and K. Zimmermann, editors, Advances in Mathematical Optimiza-

tion. Akademie-Verlag (Berlin 1988) pp. 114–125.

[708] B. Kummer. The inverse of a Lipschitz function in IRn: Complete characteri-

zation by directional derivatives. IIASA working paper 89-084 (1989).

[709] B. Kummer. Lipschitzian inverse functions, directional derivatives, and appli-

cations in C1,1-optimization. Journal of Optimization Theory and Applications

70 (1991) 559–580.

[710] B. Kummer. An implicit-function theorem for C0,1-equations and paramet-

ric C1,1-optimization. Journal of Mathematical Analysis and Applications 158

(1991) 35–46.

[711] B. Kummer. Newton’s method based on generalized derivatives for nonsmooth

functions–convergence analysis. Lectures Notes in Economics and Mathematics

182 (1992) 171–194.

[712] B. Kummer. On stability and Newton-type methods for Lipschitzian equations

with applications to optimization problems. Lecture Notes in Control and In-

formation Science 180, Springer (Berlin 1992) pp. 3–16.

[713] B. Kummer. Inverse functions of pseudo regular mappings and regularity con-

ditions. Mathematical Programming 88 (2000) 313–339.

[714] L. Kuntz and S. Scholtes. Structural analysis of nonsmooth mappings, in-

verse functions, and metric projections. Journal of Mathematical Analysis and

Applications 188 (1994) 346–386.

[715] L. Kuntz and S. Scholtes. A nonsmooth variant of the Mangasarian-Fromovitz

constraint qualification. Journal of Optimization Theory and Applications 82

(1994) 59–75.

[716] L. Kuntz and S. Scholtes. Qualitative aspects of the local approximation of

a piecewise differentiable function. Nonlinear Analysis 25 (1995) 197–215.

[717] B.M. Kwak. Complementarity problem formulation of three-dimensional fric-

tional contact. Journal of Applied Mechanics 58 (1991) 134–140.

[718] B.M. Kwak. Nonlinear complementarity problem formulation of three-

dimensional frictional contact and its numerical implementations. Contact me-

chanics, III (Madrid, 1997), Computational Mechanics (Southampton 1997) pp.

159–169.

[719] B.M. Kwak and B.C. Lee. A complementarity problem formulation for two-

dimensional frictional contact problem. Computers and Structures 18 (1988)

469–480.

[720] M. Kyono and M. Fukushima. Nonlinear proximal decomposition method with

Bregman function for solving monotone variational inequality problems. Tech-

nical Report 2000-002, Department of Applied Mathematics and Physics, Kyoto

University (May 2000).

[721] J. Kyparisis. On uniqueness of Kuhn-Tucker multipliers in nonlinear program-

ming. Mathematical Programming 32 (1985) 242–246.

[722] J. Kyparisis. Uniqueness and differentiability of solutions of parametric nonlin-

ear complementarity problems. Mathematical Programming 36 (1986) 105–113.

Bibliography 41

[723] J. Kyparisis. Sensitivity analysis framework for variational inequalities. Math-


[724] J. Kyparisis Sensitivity analysis for variational inequalities and nonlinear com-

plementarity problems. Annals of Operations Research 27 (1990) 143–174.

[725] J. Kyparisis. Solution differentiability for variational inequalities.Mathematical

Programming, Series B 48 (1990) 285–302.

[726] J. Kyparisis. Parametric variational inequalities with multivalued solution sets.


[727] J. Kyparisis and C.M. Ip. Solution behavior for parametric implicit comple-


[728] J. Kyparisis and Y.P. Qiu Solution differentiability for oligopolisitic network

equilibria. Operations Research Letters 9 (1990) 395–402.

[729] T. Larsson and M. Patriksson. A class of gap functions for variational in-

equalities. Mathematical Programming 64 (1994) 63–80.

[730] S. Lawphongpanich and D.W. Hearn. Simplicial decomposition of the asym-

metric traffic assignment problem. Transportation Research, Part B 18 (1984)

123–133.

[731] J. Lawrence and J.E. Spingarn. On fixed points of non-expansive piecewise

isometric mappings. Proceedings of the London Mathematical Society 55 (1987)

605–624.

[732] S.S. Lee. A computational method for frictional contact problem using finite

element method. International Journal for Numerical Methods in Engineering

37 (1994) 217–228.

[733] N. Lehdili and A. Moudafi. Combining the proximal algorithm and Tikhonov

regularization. Optimization 37 (1996) 239–252.

[734] H.E. Leland. Option pricing and replication with transaction costs. Journal of

Finance 40 (1985) 1283–1301.

[735] B. Lemaire. The proximal algorithm. In J.P. Penot, editor, New Methods in

Optimization and their Industrial Uses, Birkhauser-Verlag (Basel 1989) pp. 73–

88.

[736] C.E. Lemke. Bimatrix equilibrium points and mathematical programming.

Management Science 11 (1965) 681–689.

[737] C.E. Lemke and J.T. Howson, Jr. Equilibrium points of bimatrix games.

SIAM Journal of Applied Mathematics 12 (1964) 413–423.

[738] G. Lesaja. Interior Point Methods for P∗-Complementarity Problems. Ph.D.

thesis, Department of Mathematics, University of Iowa (1996).

[739] G. Lesaja. Long-step homogenous interior-point algorithm for the P∗ nonlinearcomplementarity problems. Yugoslav Journal of Operations Research 12 (2002)

17–48.

[740] A.Y.T. Leung, G.Q. Chen, and W.J. Chen. Smoothing Newton method for

solving two- and three-dimensional frictional contact problems. International

Journal for Numerical Methods in Engineering 41 (1998) 1001–1027.

[741] E.S. Levitin and B.T. Polyak. Convergence of minimizing sequence in condi-

tional extremum problems. Soviet Mathematics Doklady 7 (1996) 764–767.

[742] A.B. Levy. Implicit multifunction theorems for the sensitivity analysis of vari-

ational conditions. Mathematical Programming 74 (1996) 333–350. [Errata:

Mathematical Programming 86 (1999) 439–441].

42 Bibliography

[743] A.B. Levy. Stability of solutions to parameterized nonlinear complementarity


[744] A.B. Levy. Solution sensitivity from general principles. SIAM Journal on Con-

trol and Optimization 40 (2001) 1–38.

[745] A.B. Levy, R.A. Poliquin, and R.T. Rockafellar. Stability of locally opti-

mal solutions. SIAM Journal of Optimization 10 (2000) 580–604.

[746] A.B. Levy and R.T. Rockafellar. Sensitivity analysis of solutions to general-

ized equations. Transactions of the American Mathematical Society 345 (1994)

661–671.

[747] A.S. Lewis and J.S. Pang. Error bounds for convex inequality systems. In J.P.

Crouzeix, J.-E. Martinez-Legaz and M. Volle, editors, Generalized Convexity,

Generalized Monotonicity: Recent Results, Proceedings of the Fifth Symposium

on Generalized Convexity, Luminy-Marseille, 1996; Kluwer Academic Publishers

(Dordrecht 1998) pp. 75–110.

[748] D. Li and M. Fukushima. Smoothing Newton and quasi-Newton methods for

mixed complementarity problems. Computational Optimization and Applica-

tions 17 (2000) 203–230.

[749] D. Li and M. Fukushima. Globally convergent Broyden-like methods for semis-

mooth equations and applications to VIP, NCP and MCP. Annals of Operations

Research 103 (2001) 71–97.

[750] D. Li, N. Yamashita and M. Fukushima. A nonsmooth equation based BFGS

method for solving KKT systems in mathematical programming. Journal of


[751] W. Li. The sharp Lipschitz constants for feasible and optimal solutions of a

perturbed linear program. Linear Algebra and its Applications 187 (1993) 15–

40.

[752] W. Li. Error bounds for piecewise convex quadratic programs and applications.


[753] W. Li. Linearly convergent descent methods for the unconstrained minimization

of convex quadratic splines. Journal Optimization Theory and Applications 86

(1995) 145–172.

[754] W. Li. A merit function and a Newton-type method for symmetric linear com-

plementarity problems. In M.C. Ferris and J.S. Pang, editors, Complementarity

and Variational Problems: State of the Art, SIAM Publications (Philadelphia

1997) pp. 181–203.

[755] W. Li. Abadie’s constraint qualification, metric regularity, and error bounds

for differentiable convex inequalities. SIAM Journal on Optimization 7 (1997)

966–978.

[756] W. Li and I. Singer. Global error bounds for convex multifunctions and appli-

cations. Mathematics of Operations Research 23 (1998) 443–462.

[757] W. Li and J. Swetits. A Newton method for convex regression, data smooth-

ing, and quadratic programming with bounded constraints. SIAM Journal on


[758] W. Li and J. Swetits. A new algorithm for solving strictly convex quadratic

programs. SIAM Journal on Optimization 7 (1997) 595–619.

[759] W. Li and J. Swetits. Regularized Newton methods for minimization of convex

quadratic splines with singular Hessians. In M. Fukushima and L. Qi, editors,

Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing

Methods, Kluwer Academic Publishers (Dordrecht 1999) pp. 235–257.

Bibliography 43

[760] X.W. Li, A.K. Soh, and W.J. Chen. A new non-smooth model for three dimen-

sional frictional contact problems. Computational Mechanics 26 (2000) 538–535.

[761] P.L. Lions. Une methode iterative de resolution d’une inequation variationalle.

Israel Journal of Mathematics 31 (1978) 204–208.

[762] P.L. Lions and B Mercier. Splitting algorithms for the sum of two nonlinear

operators. SIAM Journal on Numerical Analysis 16 (1979) 964–979.

[763] J.L. Lions and G. Stampacchia. Variational inequalities. Communications on

Pure and Applied Mathematics 20 (1967) 493–519.

[764] F. Liu and M.Z. Nashed. Regularization of nonlinear ill-posed problems II:

variational inequalities and convergence rates. Set-Valued Analysis 6 (1998) 313–

344.

[765] J.M. Liu. Sensitivity analysis in nonlinear programs and variational inequalities

via continuous selections. SIAM Journal on Control and Optimization 33 (1995)

1040–1061.

[766] J.M. Liu. Strong stability in variational inequalities. SIAM Journal on Control


[767] J.M. Liu. Perturbation Analysis in Nonlinear Programs and Variational Inequal-

ities. Ph.D. thesis, Department of Operations Research, The George Washington


[768] N.G. Lloyd. Degree Theory, Cambridge University Press (Cambridge 1978).

[769] G. Lo. Complementarity Problems in Robotics. Ph.D. thesis, Department of

Mathematical Sciences, The Johns Hopkins University (1996).

[770] H.K. Lo and A. Chen. Reformulating the traffic equilibrium problem via a

smooth gap function. Mathematical and Computer Modelling 31 (2000) 179–

195.

[771] H.K. Lo and A. Chen. Traffic equilibrium problem with route-specific costs:

formulation and algorithms. Transportation Research Part B–Methodological

34 (2000) 493–513.

[772] M.S. Lojasiewicz. Division d’une distribution par une fonction analytique de

variables reelles. Comptes de Rendus de Seance, Paris 146 (1958) 683–686.

[773] M.S. Lojasiewicz. Sur la probleme de la division. Studia Mathematica 18 (1959)

87–136.

[774] M.S. Lojasiewicz. Ensembles semi-analytiques. Institut des Hautes Etudes Sci-

entiques (Bures-sur-Yvette 1964).

[775] F. Lopez de Silanes, J.R. Markusen, and T.F. Rutherford. Complemen-

tarity and increasing returns in intermediate inputs. Journal of Development

Economics 45 (1994) 101–119.

[776] A.V. Lotov. An estimate of solution set perturbations for a system of linear

inequalities. Optimization Methods and Software 6 (1995) 1–24.

[777] P. Lotstedt. Coulomb friction in two-dimensional rigid body systems.

Zeitschrift Angewandte Mathematik und Mechanik 61 (1981) 605–615.

[778] P. Lotstedt. Mechanical systems of rigid bodies subject to unilateral con-

straints. SIAM Journal on Applied Mathematics 42 (1982) 281–296.

[779] R. Lucchetti and J. Revalski, editors. Recent Developments in Well-Posed

Variational Problems. Kluwer Academic Publishers (Dordrecht 1995).

[780] X.D. Luo and Z.Q. Luo. Extension of Hoffman’s error bound to polynomial

systems. SIAM Journal on Optimization 4 (1994) 383–392.

44 Bibliography

[781] X.D. Luo and P. Tseng. On a global projection-type error bound for the linear

complementarity problem. Linear Algebra and its Applications 253 (1997) 251–

278.

[782] Z.Q. Luo. New error bounds and their applications to convergence analysis of

iterative algorithms. Mathematical Programming, Series B 88 (2000) 341–355.

[783] Z.Q. Luo, O.L. Mangasarian, J. Ren, and M.V. Solodov. New error bounds

for the linear complementarity problem. Mathematics of Operations Research

19 (1994) 880–892.

[784] Z.Q. Luo and J.S. Pang. Error bounds for analytic systems and their applica-

tions. Mathematical Programming 67 (1994) 1–28.

[785] Z.Q. Luo, J.S. Pang, and D. Ralph.Mathematical Programs with Equilibrium

Constraints. Cambridge University Press (Cambridge 1996).

[786] Z.Q. Luo and J.F. Sturm. Error bounds for quadratic systems. High perfor-

mance optimization in Applied Optimization 33 (Dordrecht 2000) 383–404.

[787] Z.Q. Luo and P. Tseng. A decomposition property for a class of square ma-

trices. Applied Mathematics Letters 4 (1991) 67–69.

[788] Z.Q. Luo and P. Tseng. On the convergence of a matrix splitting algorithm

for the symmetric monotone linear complementarity problem. SIAM Journal on

Control and Optimization 29 (1991) 1037–1060.

[789] Z.Q. Luo and P. Tseng. Error bound and convergence analysis of matrix split-

ting algorithms for the affine variational inequality problem. SIAM Journal on


[790] Z.Q. Luo and P. Tseng. On global error bound for a class of monotone affine

variational inequality problems. Operations Research Letters 11 (1992) 159–165.

[791] Z.Q. Luo and P. Tseng. On the linear convergence of descent methods for

convex essentially smooth minimization. SIAM Journal on Control and Opti-

mization 30 (1992) 408–425.

[792] Z.Q. Luo and P. Tseng. On the convergence rate of dual ascent methods for

linearly constrained convex minimization. Mathematics of Operations Research

18 (1993) 846–867.

[793] Z.Q. Luo and P. Tseng. Error bounds and convergence analysis of feasible

descent methods: a general approach. Annals of Operations Research 46/47

(1993) 157–178.

[794] Z.Q. Luo and P. Tseng. Perturbation analysis of a condition number for linear

systems. SIAM Journal on Matrix Analysis and Applications 15 (1994) 636–660.

[795] Z.Q. Luo and P. Tseng. On the rate of convergence of a distributed asyn-

chronous routing algorithm. IEEE Transactions on Automatic Control 39 (1994)

1123–1129.

[796] Z.Q. Luo and P. Tseng. A new class of merit functions for the nonlinear com-

plementarity problem. In M.C. Ferris and J.S. Pang, editors, Complementarity


1997) pp. 204–225.

[797] Z.Q. Luo and S. Zhang. On extensions of the Frank-Wolfe Theorems. Compu-

tational Optimization and Applications 13 (1999) 87–110.

[798] F.P. Luque. Asymptotic convergence analysis of the proximal point algorithm.


[799] I.J. Lustig. Feasibility issues in a primal-dual interior-point method for linear

programming. Mathematical Programming 49 (1990/91) 145–162.

Bibliography 45

[800] H.J. Luthi. On the solution of variational inequality by the ellipsoid method.


[801] H.J. Luthi and B. Bueler. The analytic center quadratic cut method for

strongly monotone variational inequality problems. SIAM Journal on Optimiza-

tion 10 (2000) 415–426.

[802] K. Madsen, H.B. Nielsen, and M.C. Pinar. A finite continuation algorithm

for bound constrained quadratic programming. SIAM Journal on Optimization

9 (1998) 62–83.

[803] K. Madsen, H.B. Nielsen, and M.C. Pinar. Bound constrained quadratic

programming via piecewise quadratic functions. Mathematical Programming 85

(1999) 135–156.

[804] T.L. Magnanti. Models and algorithms for predicting urban traffic equilib-

rium. In M. Florian, editor, Transportation Planning Models, North-Holland

(Amsterdam 1984) pp. 153–186.

[805] T.L. Magnanti and G. Perakis. A unifying geometric solution framework and

complexity analysis for variational inequalities. Mathematical Programming 71

(1995) 327–351.

[806] T.L. Magnanti and G. Perakis. Averaging schemes for variational inequalities

and systems of equations Mathematics of Operations Research 22 (1997) 568–

587.

[807] T.L. Magnanti and G. Perakis. The orthogonality theorem and the strong-F-

monotonicity condition for variational inequality algorithms. SIAM Journal on


[808] G. Maier. A quadratic programming approach for certain classes of nonlinear

structural problems. Meccanica 3 (1968) 121–130.

[809] G. Maier. A matrix structural theory of piecewise linear elastoplasticity with

interacting yield planes. Meccanica 5 (1970) 54–66.

[810] G. Maier. Incremental plastic analysis in the presence of large displacement

and physical instabilizing effects. International Journal of Solids and Structures

7 (1971) 345–372.

[811] G. Maier. Inverse problem in engineering plasticity: a quadratic programming

approach. Academia Nazionaled dei Lincei, Serie VIII, vol. LXX (1981) 203–209.

[812] G. Maier, F. Giannessi, and A. Nappi. Indirect identification of yield limits

by mathematical programming. Engineering Structures 4 (1982) 86–98.

[813] G. Maier and G. Novati. A shakedown and bounding theory allowing for non-

linear hardening and second order geometric effects with reference to discrete

structural models. In Inelastic Solids and Structures, A. Sawczuk memorial vol-

ume, Pineridge Press (Swansea 1990) pp. 451–471.

[814] G. Maier, G. Bolzon and F. Tin-Loi. Mathematical programming in engineer-

ing mechanics: some current problems. In M.C. Ferris, O.L. Mangasarian, and

J.S. Pang, editors, Complementarity: Applications, Algorithms and Extensions,


[815] O.G. Mancino and G. Stampacchia. Convex programming and variational

inequalities. Journal of Optimization Theory and Applications 9 (1972) 3–23.

[816] O.L. Mangasarian. Pseudo-convex functions. SIAM Journal on Control 3

(1965) 281–290.

[817] O.L. Mangasarian. Nonlinear Programming, McGraw-Hill (New York 1969).

[Reprinted as SIAM Classics in Applied Mathematics 10 (Philadelphia 1994).]

46 Bibliography

[818] O.L. Mangasarian. Unconstrained Lagrangians in nonlinear programming.

SIAM Journal on Control 13 (1975) 772–791.

[819] O.L. Mangasarian. Unconstrained methods in nonlinear programming. In

R.W. Cottle and C.E. Lemke, editors, Nonlinear Programming, American Math-

ematical Society (Providence 1976) pp. 169–184.

[820] O.L. Mangasarian. Equivalence of the complementarity problem to a system

of nonlinear equations. SIAM Journal of Applied Mathematics 31 (1976) 89–92.

[821] O.L. Mangasarian. Uniqueness of solution in linear programming. Linear Al-

gebra and its Applications 25 (1979) 151–162.

[822] O.L. Mangasarian. Locally unique solutions of quadratic programs, linear and

nonlinear complementarity problems. Mathematical Programming 19 (1980)

200–212.

[823] O.L. Mangasarian. A condition number for linear inequalities and linear pro-

grams. In G. Bamberg and O. Opitz, editors, Methods of Operations Research,

Proceedings of 6. Symposium uber Operations Research, Augsburg, 7-9 Septem-

ber 1981, Verlagsgruppe Athenaum/ Hain/Scriptor/Hanstein (Konigstein 1981)

pp. 3–15.

[824] O.L. Mangasarian. A condition number for differentiable convex inequalities.


[825] O.L. Mangasarian. A simple characterization of solution sets of convex pro-

grams. Operations Research Letters 7 (1988) 21–26.

[826] O.L. Mangasarian. Error bounds for nondegenerate monotone linear comple-

mentarity problems. Mathematical Programming Series B 48 (1990) 437–445.

[827] O.L. Mangasarian. Global error bounds for monotone affine variational in-

equality problems. Linear Algebra and its Applications 174 (1992) 153–164.

[828] O.L. Mangasarian. The ill-posed linear complementarity problem. In M.C.



[829] O.L. Mangasarian. Error bounds for nondifferentiable convex inequalities un-

der a strong Slater constraint qualification. Mathematical Programming 83

(1998) 187–194.

[830] O.L. Mangasarian and S. Fromovitz. The Fritz John necessary optimality

conditions in the presence of equality constraints. Journal of Mathematical Anal-

ysis and Applications 17 (1967) 34–47.

[831] O.L. Mangasarian and L. McLinden. Simple bounds for solutions of monotone

complementarity problems and convex programs. Mathematical Programming

32 (1985) 32–40.

[832] O.L. Mangasarian and J.S. Pang. The extended linear complementarity prob-

lem. SIAM Journal on Matrix Analysis and Applications 16 (1995) 359–368.

[833] O.L. Mangasarian and J. Ren. New improved bounds for the linear comple-

mentarity problem. Mathematical Programming 66 (1994) 241–255.

[834] O.L. Mangasarian and T.H. Shiau. Error bounds for monotone linear com-

plementarity problems. Mathematical Programming 36 (1986) 81–89.

[835] O.L. Mangasarian and T.H. Shiau. Lipschitz continuity of solutions of linear

inequalities, programs and complementarity problems. SIAM Journal on Control


[836] O.L. Mangasarian and M.V. Solodov. Nonlinear complementarity as uncon-

strained and constrained minimization. Mathematical Programming 62 (1993)

277–298.

Bibliography 47

[837] O.L. Mangasarian and M.V. Solodov. A linearly convergent descent method

for strongly monotone complementarity problems. Computational Optimization


[838] A.S. Manne. On the formulation and solution of economic equilibrium models.

Mathematical Programming Study 23 (1985) 1–23.

[839] A.S. Manne and T.F. Rutherford. International trade in oil, gas and car-

bon emission rights: An intertemporal general equilibrium model. The Energy

Journal 14 (1993) 1–20.

[840] G.I. Marchuk.Methods of Numerical Mathematics. Springer-Verlag (New York

1975).

[841] P. Marcotte. A new algorithm for solving variational inequalities, with appli-

cation to the traffic assignment problem. Mathematical Programming 33 (1985)

339–351.

[842] P. Marcotte. Application of Khobotov’s algorithm to variational inequalities

and network equilibrium problems. Information Systems and Operations Re-

search 29 (1991) 114–122.

[843] P. Marcotte and J.P. Dussault. A note on a globally convergent Newton

method for solving monotone variational inequalities. Operations Research Let-

ters 6 (1987) 35–42.

[844] P. Marcotte and J.P. Dussault. A sequential linear programming algorithm

for solving monotone variational inequalities. SIAM Journal on Control and

Optimization 27 (1989) 1260–1278.

[845] P. Marcotte and J.H. Wu. On the convergence of projection methods – Ap-

plication to the decomposition of affine variational inequalities. Journal of Op-

timization Theory and Applications 85 (1995) 347–362.

[846] P. Marcotte and D. Zhu. Weak sharp solutions of variational inequalities.

SIAM Journal on Optimization 9 (1998) 179–189. [Correction: same journal 10

(2000) 942.]

[847] B. Martinet. Regularisation d’inequations variationelles par approxima-

tions successives. Revue Francaise Automatique Informatique et Recherche

Operationelle 4 (1970) 154–159.

[848] B. Martinet. Determination approchee d’un point fixe d’une application pseu-

docontractante. Comptes Rendus Academie Sciences Paris 274 (1972) 163–165.

[849] J.M. Martinez and A.C. Moretti. A trust region method for minimization

of nonsmooth functions with linear constraints. Mathematical Programming 76

(1997) 431–449.

[850] J.M. Martinez and L. Qi. Inexact Newton methods for solving nonsmooth

equations. Journal of Computational and Applied Mathematics 60 (1995) 127–

145.

[851] J.A.C. Martins and A. Klarbring, editors, Computational Modeling of Con-

tact and Friction. Computer Methods in Applied Mechanics and Engineering

177, No. 3–4, North-Holland Publishing Company (Amsterdam 1999).

[852] E. Maskin and J. Tirole. A theory of dynamic oligopoly, I: Overview and

quantity competition with large fixed costs. Econometrica 56 (1988) 549–569.

[853] E. Maskin and J. Tirole. A theory of dynamic oligopoly, I: Price competition,

kinked demand curves, and edgeworth cycles. Econometrica 56 (1988) 571–579.

[854] R. Mathias and J.S. Pang. Error bounds for the linear complementarity prob-

lem with a P-matrix. Linear Algebra and its Applications 132 (1990) 123–136.

48 Bibliography

[855] L. Mathiesen. Computational experience in solving equilibrium models by a

sequence of linear complementarity problem. Operations Research 33 (1985)

1225-1250.

[856] L. Mathiesen. Computation of economic equilibria by a sequence of linear com-

plementarity problem. Mathematical Programming Study 23 (1985) 144–162.

[857] L. Mathiesen. An algorithm based on a sequence of linear complementarity

problems applied to a Walrasian equilibrium model: An example. Mathematical

Programming 37 (1987) 1–18.

[858] M.A. Mataoui. Contributions a la Decomposition et a l’Agregation des

Problemes Variationnels. These de Doctorat en Mathematiques et Automatique,

Ecole des Mines de Paris (Fontainebleau 1990).

[859] G.P. McCormick. Second order conditions for constrained minima. SIAM Jour-

nal on Applied Mathematics 15 (1967) 641–652.

[860] L. McLinden. The complementarity problem for maximal monotone multifunc-

tion. In R.W. Cottle, F. Giannessi, and J.L. Lions, editors, Variational Inequali-

ties and Complementarity Problems, John Wiley (New York 1980) pp. 251–270.

[861] L. McLinden. An analog of Moreau proximation theorem, with application

to the non-linear complementarity problem. Pacific Journal of Mathematics 88

(1980) 101–161.

[862] L. McLinden. Stable monotone variational inequalities.Mathematical Program-

ming 48 (1990) 303–338.

[863] N. Megiddo. A monotone complementarity problem with feasible solutions but

no complementarity solutions. Mathematical Programming 12 (1977) 131–132.

[864] N. Megiddo On the parametric nonlinear complementarity problem. Mathe-

matical Programming Study 7 (1978) 142–150.

[865] N. Megiddo. Pathways to the optimal set in linear programming. In N. Megiddo,

editor, Progress in Mathematical Programming, Interior-Point and Related

Methods, Springer-Verlag (New York 1989) pp. 131–158.

[866] N. Megiddo and M. Kojima. On the existence and uniqueness of solutions

in nonlinear complementarity problems. Mathematical Programming 12 (1977)

110–130.

[867] C. Metzler, B. Hobbs, and J.S. Pang. Nash-Cournot equilibria in power mar-

kets on a linearized DC network with arbitrage: Formulations and properties.

Networks and Spatial Economics (2002), forthcoming.

[868] R.R. Meyer and O.L. Mangasarian. Non-linear perturbation of linear pro-

grams. SIAM Journal on Control and Optimization 17 (1979) 745–752.

[869] E. Miersemann and H.D. Mittelmann. Continuation for parameterized non-

linear variational inequalities. Journal of Computational and Applied Mathe-

matics 26 (1989) 23–34.

[870] E. Miersemann and H.D. Mittelmann. On the continuation for variational

inequalities depending on an eigenvalue parameter. Mathematical Methods in

the Applied Science 11 (1989) 95–104.

[871] E. Miersemann and H.D. Mittelmann. Stability in obstacle problems for the von

Krmn plate. SIAM J. Mathematical Analysis 23 (1992) 1099–1116.

[872] R. Mifflin. Semismooth and semiconvex functions in constrained optimization.


[873] R. Mifflin, L. Qi, and D. Sun. Properties of the Moreau-Yosida regularization

of a piecewise C2 convex function. Mathematical Programming 84 (1999) 269–

281.

Bibliography 49

[874] G. Minty. Monotone Networks. Proceedings of the Royal Society of London

(Series A) 257 (1960) 194–212.

[875] G. Minty. Monotone (nonlinear) operators in Hilbert Space. Duke Mathematics

Journal 29 (1962) 341–346.

[876] G. Minty. Two theorems on nonlinear functional equations in Hilbert space.

Bulletin of the American Mathematical Society 69 (1963) 691–692.

[877] H.D. Mittelmann. Nonlinear parameterized equations: new results for varia-

tional problems and inequalities. In E.L. Allgower and K. Georg, editors, Com-

putational Solution of Nonlinear Systems of Equations, Lectures in Applied

Mathematics 26, American Mathematical Society (Providence 1990) pp. 451–

466.

[878] F.S. Mokhtarian and J.L. Goffin. A path-following cutting plane method for

some monotone variational inequalities. Optimization 48 (2000) 333–351.

[879] R.D.C. Monteiro and J.S. Pang. Properties of an interior-point mapping for

nonlinear mixed complementarity problems. Mathematics of Operations Re-

search 21 (1996) 629–654.

[880] R.D.C. Monteiro and J.S. Pang. On two interior-point mappings for nonlinear

semidefinite complementarity problems.Mathematics of Operations Research 23

(1998) 39–60.

[881] R.D.C. Monteiro and J.S. Pang. A potential reduction Newton method for

constrained equations. SIAM Journal on Optimization 9 (1999) 729–754.

[882] R.D.C. Monteiro, J.S. Pang, and T. Wang. A positive algorithm for the

nonlinear complementarity problem. SIAM Journal on Optimization 5 (1995)

129–148.

[883] R.D.C. Monteiro, J.S. Pang, and T. Wang. An interior point potential reduc-

tion method for constrained equations. Mathematical Programming 74 (1996)

159–196.

[884] R.D.C. Monteiro and T. Tsuchiya. Limiting behavior of the derivatives of

certain trajectories associated with a monotone horizontal linear complemen-

tarity problem. Mathematics of Operations Research 21 (1996) 793–814.

[885] R.D.C. Monteiro and S.J. Wright. Local convergence of interior-point algo-

rithms for degenerate monotone LCP. Computational Optimization and Appli-

cations 3 (1994) 131–156.

[886] R.D.C. Monteiro and P.R. Zanjacomo. General interior-point maps and ex-

istence of weighted paths for nonlinear semidefinite complementarity problems.


[887] B.S. Mordukhovich. Approximation Methods in Problems of Optimization and

Control. Nauka (Moscow 1988).

[888] B. Mordukhovich. Complete characterization of openness, metric regularity,

and Lipschitzian properties. Transactions of the American Mathematical Society

340 (1993) 1–36.

[889] B. Mordukhovich. Lipschitzian stability of constraint systems and generalized

equations. Nonlinear Analysis 22 (1994) 173–206.

[890] B. Mordukhovich. Stability theory for parametric generalized equations and

variational inequalities via nonsmooth analysis. Transactions of the American

Mathematical Society 343 (1994) 609–657.

[891] B. Mordukhovich. Coderivatives of set-valued mappings: Calculus and appli-

cations. Nonlinear Analysis and Theory 30 (1997) 3059–3070.

50 Bibliography

[892] B. Mordukhovich and J.V. Outrata. On second-order subdifferentials and

their applications. SIAM Journal on Optimization 12 (2001) 139–169.

[893] J.J. More. Coercivity conditions in nonlinear complementarity problems. SIAM

Review 16 (1974) 1–16.

[894] J.J. More. Classes of functions and feasibility conditions in nonlinear comple-


[895] J.J. More. Global methods for nonlinear complementarity problems. Mathe-

matics of Operations Research 21 (1996) 589–614.

[896] J. More and W.C. Rheinboldt. On P - and S-functions and related class of

n-dimensional nonlinear mappings. Linear Algebra and its Applications 6 (1973)

45–68.

[897] J.J. More and D.C. Sorenson. Computing a trust region step. SIAM Journal

on Scientific and Statistical Computing 4 (1983) 553–572.

[898] J.J. Moreau. Numerical aspects of the sweeping process. Computational mod-

eling of contact and friction. Computer Methods in Applied Mechanics and

Engineering 177 (1999) 329–349.

[899] U. Mosco. Dual variational inequalities. Journal of Mathematical Analysis and

Applications 40 (1972) 202–206.

[900] U. Mosco. Implicit variational problems and quasi-variational inequalities. In

J. Gossez, E.J. Lami Dozo, J. Mawhin and L. Waelbroeck, editors, Nonlinear

Operators and the Calculus of Variations, Lecture Notes in Mathematics 543,

Springer-Verlag (Berlin 1976) pp. 82–156.

[901] A. Moudafi and M. Thera. Finding a zero of the sum of two maximal mono-

tone operators. Journal of Optimization Theory and Applications 94 (1997)

425–448.

[902] T.S. Munson, F. Facchinei, M.C. Ferris, A. Fischer, and C. Kanzow. The

semismooth algorithm for large scale complementarity problems. INFORMS

Journal on Computing 13 (2001) 294–311.

[903] F.H. Murphy, H.D. Sherali, and A.L. Soyster. A mathematical program-

ming approach for determining oligopolistic market equilibrium. Mathematical

Programming 24 (1982) 92–106.

[904] G.S.R. Murthy, T. Parthasarathy, and M. Sabatini. Lipschitzian Q-

matrices are P-matrices. Mathematical Programming 74 (1996) 55–58.

[905] K.G. Murty and S.N. Kabadi. Some NP-complete problems in quadratic and

nonlinear programming. Mathematical Programming 39 (1987) 117–129.

[906] A. Nagurney. Competitive equilibrium problems, variational inequalities and

regional science. Journal of Regional Science 27 (1987) 55–76.

[907] A. Nagurney. Network Economics: a Variational Inequality Approach. Ad-

vances in Computational Economics, 1, Kluwer Academic Publishers (Dordrecht

1993).

[908] A. Nappi. System identification for yield limits and hardening moduli in dis-

crete elastic-plastic structures by nonlinear programming. Applied Mathemati-

cal Modeling 6 (1982) 441–448.

[909] J.F. Nash. Equilibrium points in n-person games. Proceedings of the National

Academy of Sciences 36 (1950) 48–49.

[910] J.F. Nash. Non-cooperative games. Annals of Mathematics 54 (1951) 286–295.

Bibliography 51

[911] M.Z. Nashed and F. Liu. On nonlinear ill-posed problems II: Monotone opera-

tor equations and monotone variational inequalities. In A.G. Kartsatos, editor,

Theory and Applications of Nonlinear Operators of Accretive and Monotone

Type, Marcel Dekker (New York 1996) pp. 223–240.

[912] Y. Nesterov and A. Nemirovskii. Interior-Point Polynomial Algorithms in

Convex Programming. SIAM Publications (Philadelphia 1994).

[913] K.F. Ng and W.H. Yang. Error bound and its relation to regularity.

Manuscript, Department of Mathematics, Chinese University of Hong Kong

(December 2001).

[914] K.F. Ng and W.H. Yang. Error bounds for abstract linear inequality system.


[915] K.F. Ng and X.Y. Zheng. Global error bounds with fractional exponents.


[916] K.F. Ng and X.Y. Zheng. Constrained error bounds of quadratic functions and

piecewise affine inequality systems. Manuscript, Department of Mathematics,

Chinese University of Hong Kong (October 2001).

[917] K.F. Ng and X.Y. Zheng. The least Hoffman’s error bound for linear inequality

system. Revised manuscript, Department of Mathematics, Chinese University

of Hong Kong (December 2001).

[918] K.F. Ng and X.Y. Zheng. Global error bounds for lower semicontinuous func-

tions in normed spaces. SIAM Journal on Optimization 12 (2001) 1–17.

[919] S. Nguyen and C. Dupuis. An efficient method for computing traffic equilibria

in networks with asymmetric transportation costs. Transportation Science 18

(1984) 185–202.

[920] J. Nocedal and S.J. Wright. Numerical optimization. Springer-Verlag (New

York 1999).

[921] K.P. Oh. The numerical solution of dynamically loaded elastohydrodynamic

contact as a nonlinear complementarity problem. Journal of Tribology 106

(1984) 88–95.

[922] K.P. Oh. Analysis of a needle bearing. Journal of Tribology 106 (1984) 78–87.

[923] K.P. Oh. The formulation of the mixed lubrication problem as a generalized

nonlinear complementarity problem. Journal of Tribology 108 (1986) 598–604.

[924] K.P. Oh and P.K. Goenka. The elastohydrodynamic solution of journal bear-

ings under dynamic loading. Journal of Tribology 107 (1985) 389–395.

[925] K.P. Oh, C.H. Li, and P.K. Goenka. Elastohydrodynamic lubrication of piston

skirts. Journal of Tribology 109 (1987) 356–362.

[926] T. Ohtsuki, T. Fujisawa, and S. Kumagai. Existence theorems and a solution

algorithm for piecewise linear resistive networks. SIAM Journal on Mathematical

Analysis 8 (1977) 69–99.

[927] K. Okuguchi. Expectations and Stability in Oligopoly Models. Lecture Notes

in Economics and Mathematical Systems 138, Springer-Verlag (Berlin 1976).

[928] Z. Opial. Weak convergence of the sequence of successive approximations for

nonexpansive mappings. Bulletin of the American Mathematical Society 73

(1967) 591–597.

[929] J.M. Ortega and W.C. Rheinboldt. Iterative Solution of Nonlinear Equations

in Several Variables, Academic Press (New York 1970).

[930] A. Ostrowski. Solution of Equations and Systems of Equations, second edition,

Academic Press (New York 1966).

52 Bibliography

[931] J. Outrata Optimality conditions for a class of mathematical programs with

equilibrium constraints. Mathematics of Operations Research 24 (1999) 627–

644.

[932] J. Outrata, M. Kocvara, and J. Zowe. Nonsmooth Approach to Optimiza-

tion Problems with Equilibrium Constraints: Theory, Applications and Numer-

ical Results, Kluwer Academic Publishers (Dordrecht 1998).

[933] J.V. Outrata and J. Zowe. A Newton method for a class of quasi-variational

inequalities. Computational Optimization and Applications 4 (1995) 5-21.

[934] R.S. Palais. Natural operations on differential forms. Transactions of the Amer-

ican Mathematical Society 22 (1959) 125–141.

[935] P.D. Panagiotopoulos. Inequality Problems in Mechanics and Applications,

Birkhauser Inc. (Boston 1985).

[936] P.D. Panagiotopoulos. Hemivariational Inequalities, Springer-Verlag (Berlin

1993).

[937] J.S. Pang. Least-Element Complementarity Theory. Ph.D. thesis, Department

of Operations Research, Stanford University (Stanford 1976).

[938] J.S. Pang. The implicit complementarity problem. In O.L. Mangasarian, R.R.

Meyer and S.M. Robinson, editors, Nonlinear Programming 4, Proceedings of

the Conference Nonlinear Programming 4, 1980; Academic Press (New York

1981) pp. 487–518.

[939] J.S. Pang. Asymmetric variational inequality problems over product sets: Ap-

plications and iterative methods.Mathematical Programming 31 (1985) 206–219

[940] J.S. Pang. Inexact Newton methods for the nonlinear complementarity problem.


[941] J.S. Pang. A posteriori error bounds for the linearly-constrained variational

inequality problem. Mathematics of Operations Research 12 (1987) 474–484.

[942] J.S. Pang. Newton’s method for B-differentiable equations. Mathematics of Op-


[943] J.S. Pang. Solution differentiability and continuation of Newton’s method for

variational inequality problems over polyhedral sets. Journal of Optimization

Theory and Applications 66 (1990) 121–135.

[944] J.S. Pang. A B-differentiable equation based, globally and locally quadratically

convergent algorithm for nonlinear programs, complementarity and variational

inequality problems. Mathematical Programming 51 (1991) 101–131.

[945] J.S. Pang. Convergence of splitting and Newton methods for complementarity

problems: An application of some sensitivity results. Mathematical Program-

ming 58 (1993) 149–160.

[946] J.S. Pang. A degree-theoretic approach to parametric nonsmooth equations

with multivalued perturbed solution sets. Mathematical Programming, Series B

62 (1993) 359–384.

[947] J.S. Pang. Complementarity problems. In R. Horst and P. Pardalos, editors,

Handbook in Global Optimization, Kluwer Academic Publishers (Boston 1994).

[948] J.S. Pang. Serial and parallel computation of Karush-Kuhn-Tucker points via

nonsmooth equations. SIAM Journal on Optimization 4 (1994) 872–893.

[949] J.S. Pang. Necessary and sufficient conditions for solution stability in paramet-

ric nonsmooth equations. In D.Z. Zhu, L. Qi, and R. Womersley, editors, Recent

Advances in Nonsmooth Optimization, World Scientific Publishers (River Ridge

1995) pp. 260–287.

Bibliography 53

[950] J.S. Pang. Error bounds in mathematical programming. Mathematical Pro-

gramming, Series B 79 (1997) 299–332.

[951] J.S. Pang and M. Fukushima. Complementarity constraint qualifications and

simplified B-differentiability for mathematical programs with equilibrium con-

straints. Computational Optimization and Applications 13 (1999) 111–136.

[952] J.S. Pang and S.A. Gabriel. NE/SQP: A robust algorithm for the nonlinear

complementarity problem. Mathematical Programming 60 (1993) 295–338.

[953] J.S. Pang, S.P. Han, and N. Rangaraj. Minimization of locally Lipschitzian

functions SIAM Journal on Optimization 1 (1991) 57–82.

[954] J.S. Pang, B.F. Hobbs, and C. Day. Properties of oligopolistic market equilib-

ria in linearized DC power networks with arbitrage and supply function conjec-

tures. Manuscript, Department of Mathematical Sciences, The Johns Hopkins

University (July 2001).

[955] J.S. Pang and J. Huang. Pricing American options with transaction costs by

complementarity methods. In M. Avellandeda, editor, Quantitative Analysis in

Financial Markets, [Collected Papers of the New York University Mathematical

Finance Seminar, Volume III], World Scientific Press (New Jersey 2002) pp.

172–198.

[956] J.S. Pang and L. Qi. Nonsmooth equations: motivation and algorithms. SIAM


[957] J.S. Pang and L. Qi. A globally convergent Newton method for convex SC1

minimization problems. Journal of Optimization Theory and Applications 85

(1995) 633–648.

[958] J.S. Pang and D. Ralph. Piecewise smoothness, local invertibility, and para-

metric analysis of normal maps. Mathematics of Operations Research 21 (1996)

401–426.

[959] J.S. Pang and D.E. Stewart. A unified approach to discrete frictional contact

problems, International Journal of Engineering Science 37 (1999) 1747–1768.

[960] J.S. Pang, D. Sun, and J. Sun. Semismooth homeomorphisms and strong sta-

bility of semidefinite and Lorentz complementarity problems. Mathematics of

Operations Research, forthcoming.

[961] J.S. Pang and J.C. Trinkle. Complementarity formulations and existence of

solutions of multi-rigid-body contact problems with Coulomb friction. Mathe-


[962] J.S. Pang and J.C. Trinkle. Stability characterization of rigid body contact

problems with Coulomb friction. Zeitschrift fur Angewandte Mathematik und

Mechanik 80 (2000) 643–663.

[963] J.S. Pang, J.C. Trinkle, and G. Lo. A complementarity approach to a qua-

sistatic multi-rigid-body contact problem. Computational Optimization and Ap-

plications 5 (1996) 139–154.

[964] J.S. Pang and J.M. Yang. Parallel Newton methods for the nonlinear comple-

mentarity problem. Mathematical Programming, Series B 42 (1988) 407–420.

[965] J.S. Pang and J.C. Yao. On a generalization of a normal map and equation.


[966] J.S. Pang and C.S. Yu. Linearized simplicial decomposition methods for com-

puting traffic equilibria on networks. Networks 14 (1984) 427–438.

[967] T. Parthasarathy. On global univalence theorems. Lecture Notes in Mathe-

matics 977, Springer-Verlag (Berlin 1983).

54 Bibliography

[968] T. Parthasarathy, D. Sampangi Raman, and B. Sriparna. Relationship be-

tween strong monotonicity property, P0-property, and the GUS property in

semidefinite linear complementarity problems. Mathematics of Operations Re-

search 27 (2002) forthcoming.

[969] G.B. Passty. Ergodic convergence to a zero of the sum of monotone operators

in Hilbert space. Journal of Mathematical Analysis and Applications 72 (1979)

383–390.

[970] M. Patriksson. On the convergence of descent methods for monotone varia-

tional inequalities. Operations Research Letters 16 (1994) 265–269.

[971] M. Patriksson. The Traffic Assignment Problem, Models and Methods, VSP

(Utretch 1994).

[972] M. Patriksson. Merit functions and descent algorithms for a class of variational

inequality problems. Optimization 41 (1997) 37–55.

[973] M. Patriksson. Nonlinear Programming and Variational Inequality Problems.

A Unified Approach. Kluwer Academic Publishers (Dordrecht 1999).

[974] M. Patriksson. A new merit function and an SQP method for non-strictly

monotone variational inequalities. In G. Di Pillo and F. Giannessi, editors,

Nonlinear Optimization and Related Topics, Kluwer Academic Publishers (Dor-

drecht 2000) pp. 257–275.

[975] D.W. Peaceman and H.H. Rachford. The numerical solution of parabolic and

elliptic differential equations. SIAM Journal 3 (1955) 28–41.

[976] J.M. Peng. Global method for monotone variational inequality problems with

inequality constraints. Journal of Optimization Theory and Applications 95

(1997) 419–430.

[977] J.M. Peng. Equivalence of variational inequality problems to unconstrained

minimization. Mathematical Programming 78 (1997) 347–355.

[978] J.M. Peng. Global method for monotone variational inequality problems on

polyhedral sets. Optimization Methods and Software 7 (1997) 111–122.

[979] J.M. Peng. Convexity of the implicit Lagrangian. Journal of Optimization The-

ory and Applications 92 (1997) 331–341.

[980] J.M. Peng. Derivative-free methods for monotone variational inequality and

complementarity problems. Journal of Optimization Theory and Applications

99 (1998) 235–252.

[981] J.M. Peng. A smoothing function and its application. In M. Fukushima and

L. Qi, editors, Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and

Smoothing Methods, Kluwer Academic Publishers (Dordrecht 1999) pp. 293–

316.

[982] J.M. Peng and M. Fukushima. A hybrid Newton method for solving the vari-

ational inequality problem via the D-gap function. Mathematical Programming

86 (1999) 367–386.

[983] J.M. Peng, C. Kanzow, and M. Fukushima. A hybrid Josephy-Newton

method for solving box constrained variational inequality problems via the D-

gap function Optimization Methods and Software 10 (1999) 687–710.

[984] J.M. Peng and Z.H. Lin. A noninterior continuation method for generalized

linear complementarity problems. Mathematical Programming 86 (1999) 533–

563.

[985] J.M. Peng, C. Roos, and A. Terlaky. A logarithmic barrier approach to Fis-

cher function. In G. Di Pillo and F. Giannessi, editors, Nonlinear Optimization

and Related Topics, Kluwer Academic Publishers (Dordrecht 2000) pp. 277–297.

Bibliography 55

[986] J.M. Peng, C. Roos, T. Terlaky, and A. Yoshise. Self-regular proximi-

ties and new search directions for nonlinear P∗(κ) complementarity problems.Manuscript, Department of Computing and Software, McMaster University

(November 2000).

[987] J.M. Peng and Y. Yuan. Unconstrained methods for generalized complemen-

tarity problems. Journal of Computational Mathematics 15 (1997) 253–264.

[988] J.P. Penot. Metric regularity, openness and Lipschitzian behavior of multi-

functions. Nonlinear Analysis, Theory, Methods, and Applications 13 (1989)

629–643.

[989] A.M. Pereira and J.B. Shoven. Survey of dynamic computational general

equilibrium models for tax policy evaluation. Journal of Policy model 10 (1988)

401–436.

[990] C. Perroni and T. Rutherford. International trade in carbon emission rights

and basic materials: General equilibrium calculations for 2020. Scandinavian

Journal of Economics 95 (1993) 257–278.

[991] F. Pfeiffer and C. Glocker. Multibody Dynamics with Unilateral Contacts,

John Wiley (New York 1996).

[992] S. Pieraccini Hybrid Newton-type method for a class of semismooth equations.


[993] M.C. Pinar and B. Chen. 1 solution of linear inequalities. IMA Journal of

Numerical Analysis 19 (1999) 19–37.

[994] M.C. Pinar and S.A. Zenios. On smoothing exact penalty functions for convex

constrained optimization. SIAM Journal on Optimization 4 (1994) 486–511.

[995] E. Polak. Optimization: Algorithms and Consistent Approximations. Springer

(New York 1997).

[996] E. Polak, and L. Qi. Globally and superlinearly convergent algorithm for min-

imizing a normal merit function. SIAM Journal on Control and Optimization

36 (1998) 1005–1019.

[997] R. Poliquin and L. Qi. Iteration functions in some nonsmooth optimization

algorithms. Mathematics of Operations Research 20 (1995) 479–496.

[998] B.T. Polyak. Introduction to Optimization. Optimization Software, Inc. (New

York 1987).

[999] F.A. Potra, L. Qi, and D. Sun. Secant methods for semismooth equations.

Numerische Mathematik 80 (1998) 305–324.

[1000] F.A. Potra and S.J. Wright Interior-point methods. Journal of Computa-

tional and Applied Mathematics 124 (2000) 281–302.

[1001] F.A. Potra and Y. Ye. Interior-point methods for nonlinear complementarity


[1002] P.V. Preckel. Alternative algorithms for computing economic equilibria.Math-

ematical Programming Study 23 (1985) 163–172.

[1003] M.E. Primak. A computational process of search for equilibrium problems.

Cybernetics 9 (1975) 106–113.

[1004] H.D. Qi. Tikhonov regularization methods for variational inequality problems.


[1005] H.D. Qi. On minimizing and stationary sequences of a new class of merit func-

tions for nonlinear complementarity problems. Journal of Optimization Theory


56 Bibliography

[1006] H.D. Qi. A regularized smoothing Newton method for box constrained varia-

tional inequality problems with P0 functions. SIAM Journal on Optimization

10 (2000) 315–330.

[1007] H.D. Qi and L.Z. Liao. A smoothing Newton method for general nonlinear

complementarity problems. Computational Optimization and Applications 17

(2000) 231-254.

[1008] H.D. Qi and L. Qi. A new QP-free, globally convergent, locally superlinearly

convergent algorithm for inequality constrained optimization. SIAM Journal on

Optimization 11 (2000) 113–132.

[1009] L. Qi. LC1 functions and LC1 optimization problems. Applied Mathematics

Report 91/21, University of New South Wales (Sydney 1991).

[1010] L. Qi. Convergence analysis of some algorithms for solving nonsmooth equations.


[1011] L. Qi. Superlinearly convergent approximate Newton method for LC1 optimiza-

tion problems. Mathematical Programming 64 (1994) 277–294.

[1012] L. Qi. Trust region algorithms for solving nonsmooth equations. SIAM Journal


[1013] L. Qi. C-differentiability, C-differential operators and generalized Newton meth-

ods. Applied Mathematics Report 96/5, University of New South Wales (Sydney

1996).

[1014] L. Qi. On superlinear convergence of quasi-Newton methods for nonsmooth

equations. Operations Research Letters 20 (1997) 223–228.

[1015] L. Qi. Regular pseudo-smooth NCP and BVIP functions and globally and

quadratically convergent generalized Newton methods for complementarity and

variational inequality problems. Mathematics of Operations Research 24 (1999)

440–471.

[1016] L. Qi and X. Chen. A parametrized Newton method and a quasi-Newton

method for nonsmooth equations. Computational Optimization and Applica-

tions 3 (1994) 157–179.

[1017] L. Qi and X. Chen. A globally convergent successive approximation method

for severely nonsmooth equations. SIAM Journal on Control Optimization 33

(1995) 402–418.

[1018] L. Qi and H.Y. Jiang. On the range sets of variational inequalities. Journal of


[1019] L. Qi and H.Y. Jiang. Semismooth Karush-Kuhn-Tucker equations and conver-

gence analysis of Newton and quasi-Newton methods for solving these equations.


[1020] L. Qi and J. Sun. A trust region algorithm for minimization of locally Lipschitz

functions. Mathematical Programming 66 (1994) 25–43.

[1021] L. Qi and D. Sun. A survey of some nonsmooth equations and smoothing

Newton methods. In A. Eberhard, R. Hill, D. Ralph and B.M. Glover, edi-

tors, Progress in Optimization, Kluwer Academic Publishers, (Dordrecht 2000)

pp. 121–146.

[1022] L. Qi and D. Sun. Improving the convergence of non-interior point algo-

rithms for nonlinear complementarity problems. Mathematics of Computation

69 (2000) 283–304.

[1023] L. Qi and D. Sun. Smoothing functions and a smoothing Newton method for

complementarity and variational inequality problems. Journal of Optimization


Bibliography 57

[1024] L. Qi, D. Sun, and G. Zhou. A new look at smoothing Newton methods for

nonlinear complementarity problems and box constrained variational inequali-

ties. Mathematical Programming 87 (2000) 1–35.

[1025] L. Qi and J. Sun. A nonsmooth version of Newton’s method. Mathematical

Programming 58 (1993) 353–368.

[1026] L. Qi and G. Zhou. A smoothing Newton method for minimizing a sum of

Euclidean norms. SIAM Journal on Optimization 11 (2000) 389–410.

[1027] Y.P. Qiu. Solution properties of oligopolistic network equilibria. Networks 21

(1991) 565–580.

[1028] Y.P. Qiu and T.L. Magnanti. Sensitivity analysis for variational inequalities

defined on polyhedral sets. Mathematics of Operations Research 14 (1989) 410–

432.

[1029] Y.P. Qiu and T.L. Magnanti. Sensitivity analysis for variational inequalities.


[1030] M. Queiroz, J. Judice, and C. Humes, Jr. The symmetric eigenvalue comple-

mentarity problem. Manuscript, Department of Computer Science, University

of Sao Paulo, Brazil (February 2002). [Submitted to Mathematics of Computa-

tion.]

[1031] H. Rademacher. Uber partielle und totale Differenzierbarkeit I. Mathematical

Annals 89 (1919) 340–359.

[1032] V.T. Rajan, R. Burridge, and J.T. Schwartz. Dynamics of a rigid body in

frictional contact with rigid walls. IEEE International Conference on Robotics

and Automation, Raleigh NC (March 1987) 671–677.

[1033] D. Ralph. A new proof of Robinson’s homeomorphism theorem for PL-normal

maps. Linear Algebra and Applications 178 (1993) 249–260.

[1034] D. Ralph. On branching numbers of normal manifolds. Nonlinear Analysis 22

(1994) 1041–1050.

[1035] D. Ralph. Global convergence of damped Newton’s method for nonsmooth

equations, via the path search. Mathematics of Operations Research 19 (1994)

352–389.

[1036] D. Ralph and S. Dempe. Directional derivatives of the solution of a parametric

nonlinear program. Mathematical Programming 70 (1995) 159–172.

[1037] D. Ralph and S. Scholtes. Sensitivity analysis of composite piecewise smooth

equations. Mathematical Programming 76 (1997) 593–612.

[1038] D. Ralph and S.J. Wright. Superlinear convergence of an interior-point

method for monotone variational inequalities. In M.C. Ferris and J.S. Pang,

editors, Complementarity and Variational Problems: State of the Art, SIAM

Publications (Philadelphia 1997) pp. 345–385.

[1039] D. Ralph and S.J. Wright. Superlinear convergence of an interior-point

method despite dependent constraints. Mathematics of Operations Research 25

(2000) 179–194.

[1040] G. Ravindran and M.S. Gowda. Regularization of P0-functions in box varia-

tional inequality problems. SIAM Journal on Optimization 11 (2000) 748–760.

[1041] A. Reinoza. The strong positivity conditions. Mathematics of Operations Re-

search 10 (1985) 54–62.

[1042] W.C. Rheinboldt. On M-functions and their application to nonlinear Gauss-

Seidel iterations and to network flows. Journal of Mathematical Analysis and

Applications 32 (1970) 274–307.

58 Bibliography

[1043] W.C. Rheinboldt and J.S. Vandergraft. On piecewise affine mappings in

IRn. SIAM Journal on Applied Mathematics 29 (1975) 680–689.

[1044] V. Rico-Ramirez, B.A. Allan, and A.W. Westerberg. Conditional model-

ing. I. Requirements for an equation-based environment. Industrial and Engi-

neering Chemistry Research 38 (1999) 519–530.

[1045] V. Rico-Ramirez and A.W. Westerberg. Conditional modeling. 2. Solving

using complementarity and boundary-crossing formulations. Industrial and En-

gineering Chemistry Research 38 (1999) 531–553.

[1046] V. Rico-Ramirez and A.W. Westerberg. Interior point methods for the so-

lution of conditional models. Computers and Chemical Engineering 26 (2002)

375–383.

[1047] M. Rivier, M. Ventosa, A. Ramos, F. Martinez-Corcoles, and A.C.

Toscano. A generation operation planning model in deregulated electricity mar-

kets based on the complementarity problem. In M.C. Ferris, O.L. Mangasarian,

and J.S. Pang, editors, Complementarity: Applications, Algorithms and Exten-

sions, Kluwer Academic Publishers (Dordrecht 2001) pp. 273–296.

[1048] T. Robertson, F.T. Wright, and R.L. Dykstra. Order restricted Statistical

Inference. John Wiley & Sons, Ltd. (Chichester 1988).

[1049] S.M. Robinson. A quadratically-convergent algorithm for general nonlinear pro-

gramming problems. Mathematical Programming 3 (1972) 145–156.

[1050] S.M. Robinson. Extension of Newton’s method to nonlinear functions with

values in a cone. Numerische Mathematik 19 (1972) 341–347.

[1051] S.M. Robinson. Normed convex processes. Transactions of the American Math-

ematical Society 174 (1972) 127–140.

[1052] S.M. Robinson. Perturbed Kuhn-Tucker points and rates of convergence for

a class of nonlinear-programming algorithms. Mathematical Programming 7

(1974) 1–16.

[1053] S.M. Robinson. An application of error bounds for convex programming in a

linear space. SIAM Journal on Control 13 (1975) 271–273.

[1054] S.M. Robinson. Stability theory for systems of inequalities. II. Differentiable

nonlinear systems. SIAM Journal on Numerical Analysis 13 (1976) 497–513.

[1055] S.M. Robinson. Regularity and stability for convex multivalued functions.


[1056] S.M. Robinson. A characterization of stability in linear programming. Opera-

tions Research 25 (1977) 435–447.

[1057] S.M. Robinson. Generalized equations and their solutions. I. Basic theory.

Mathematical Programming Study 10 (1979) 128–141.

[1058] S.M. Robinson, editor. Analysis and Computation of Fixed Points, Academic

Press (New York 1980).

[1059] S.M. Robinson. Strongly regular generalized equations. Mathematics of Oper-


[1060] S.M. Robinson. Some continuity properties of polyhedral multifunctions.Math-


[1061] S.M. Robinson. Generalized equations and their solutions. II. Applications to

nonlinear programming. Mathematical Programming Study 19 (1982) 200–221.

[1062] S.M. Robinson. Local structure of feasible sets in nonlinear programming. I.

Regularity. Numerical methods (Caracas, 1982), Lecture Notes in Mathematics

1005, Springer (Berlin 1983) pp. 240–251.

Bibliography 59

[1063] S.M. Robinson. Generalized equations. In A. Bachem, M. Grotschel, and B.

Korte, editors, Mathematical Programming: The State of the Art, Springer-

Verlag (Berlin 1983) pp. 346–367.

[1064] S.M. Robinson. Local structure of feasible sets in nonlinear programming. II.

Nondegeneracy. Mathematical Programming Study 22 (1984) 217–230.

[1065] S.M. Robinson. Implicit B-differentiability in generalized equations. Technical

report #2854, Mathematics Research Center, University of Wisconsin, Madison

(1985).

[1066] S.M. Robinson. Local structure of feasible sets in nonlinear programming. III.

Stability and sensitivity. Mathematical Programming Study 30 (1987) 45–66.

[1067] S.M. Robinson. Mathematical foundations of nonsmooth embedding methods.


[1068] S.M. Robinson. An implicit-function theorem for a class of nonsmooth func-

tions. Mathematics of Operations Research 16 (1991) 292–309.

[1069] S.M. Robinson. Normal maps induced by linear transformations. Mathematics


[1070] S.M. Robinson. Homeomorphism conditions for normal maps of polyhedra. In

A. Ioffe, M. Marcus, and S. Reich, editors, Optimization and Nonlinear Analysis

(Haifa, 1990), Pitman Research Notes in Mathematics Series 244, Longman

House (Harlow 1992) pp. 240–248.

[1071] S.M. Robinson. Nonsingularity and symmetry for linear normal maps. Mathe-


[1072] S.M. Robinson. Shadow prices for measures of effectiveness. I. Linear model.

Operations Research 41 (1993) 518–535. [Erratum: Operations Research 48

(2000) 185.]

[1073] S.M. Robinson. Shadow prices for measures of effectiveness. II. General model.


[1074] S.M. Robinson. Newton’s method for a class of nonsmooth functions. Set Valued

Analysis 2 (1994) 291–305.

[1075] S.M. Robinson. Differential stability conditions for saddle problems on products

of convex polyhedra. In H. Fischer, B. Riedmller and S. Schffler, editors, Ap-

plied Mathematics and Parallel Computing. Festschrift for Klaus Ritter, Physica

Verlag (Heidelberg 1996) pp. 265–274.

[1076] S.M. Robinson. A reduction method for variational inequalities. Mathematical

Programming 80 (1998) 161–169.

[1077] S.M. Robinson. Composition duality and maximal monotonicity. Mathematical

Programming 85 (1999) 1–13.

[1078] S.M. Robinson. Structural methods in the solution of variational inequalities.

In G. Di Pillo and F. Giannessi, editors, Nonlinear Optimization and Related

Topics, Kluwer Academic Publishers (Dordrecht 2000) pp. 369–380.

[1079] R.T. Rockafellar. Convex Analysis, Princeton University Press (Princeton

1970).

[1080] R.T. Rockafellar. On the maximal monotonicity of subdifferential mappings.

Pacific Journal of Mathematics 33 (1970) 209–216.

[1081] R.T. Rockafellar. The multiplier method of Hestnes and Powell applied

to convex programming. Journal of Optimization Theory and Applications 12

(1973) 555–562.

60 Bibliography

[1082] R.T. Rockafellar. Monotone operators and the proximal point algorithm.


[1083] R.T. Rockafellar. Augmented Lagrangians and applications of the proximal

point algorithm in convex programming. Mathematics of Operations Research

1 (1976) 97–16.

[1084] R.T. Rockafellar. Linear-quadratic programming and optimal control. SIAM

Journal on Control and Optimization 25 (1987) 781–814.

[1085] R.T. Rockafellar. Proto-differentiability of set-valued mappings and its appli-

cations in optimization. In H. Attouch, J.P. Aubin, F.H. Clarke, and I. Ekeland,

editors, Analyse Non Lineaire, Gauthier-Villars (Paris 1989) pp. 449–482.

[1086] R.T. Rockafellar. Computational schemes for large-scale problems in ex-

tended linear-quadratic programming. Mathematical Programming 48 (1990)

447–474.

[1087] R.T. Rockafellar and R.J.-B. Wets. A Lagrangian finite generation tech-

nique for solving linear-quadratic problems in stochastic programming. Mathe-

matical Programming Study 28 (1986) 63–93.

[1088] R.T. Rockafellar and R.J.-B. Wets. Generalized linear-quadratic problems

of deterministic and stochastic optimal control in discrete time. SIAM Journal

on Control and Optimization 28 (1990) 810–822.

[1089] R.T. Rockafellar and R.J.-B. Wets. Variational Analysis, Springer-Verlag

(Berlin 1998).

[1090] J.F. Rodrigues. Obstacle Problems in Mathematical Physics. Elsevier Science

Publishers B.V. (Amsterdam 1987).

[1091] C. Roos, T. Terlaky, and Ph. Vial. Theory and Algorithms for Linear Op-

timization: An Interior Point Approach, John Wiley & Sons, Inc. (Sommerset

1999).

[1092] M.A.G. Ruggiero, J.M. Martinez, and S.A. Santos. Solving nonlinear equa-

tions by means of quasi-Newton methods with globalization. In D. Du, L. Qi, and

R. Womersley, editors, Recent Advances in Nonsmooth Optimization, World

Scientific Publishers (River Ridge 1995) pp. 121–140.

[1093] T.F. Rutherford. Applied General Equilibrium Modeling. Ph.D. thesis, De-

partment of Operations Research, Stanford University (1987).

[1094] T.F. Rutherford. Extensions of GAMS for complementarity problems arising

in applied economic analysis. Journal of Economic Dynamics and Control 19

(1995) 1299-1324.

[1095] V.L. Rvachev. Theory of R-Functions and Some Applications. (In Russian.)

Naukova Dumka (1982).

[1096] P.A. Samelson, R.M. Thrall, and O. Wesler. A partition theorem for Eu-

clidean n-space. Proceedings of the American Mathematical Society 9 (1958)

805–807.

[1097] P.A. Samuelson. Prices of factors and goods in general equilibrium. Review of

Economic Studies 21 (1953) 1–20.

[1098] H.E. Scarf. The approximation of fixed points of a continuous mapping. SIAM

Journal on Applied Mathematics 15 (1967) 1328–1343.

[1099] H.E. Scarf. (In collaboration with T. Hansen.) The Computation of Economic

Equilibria. Yale University Press, (New Haven 1973).

Bibliography 61

[1100] H. Scheel and S. Scholtes. Mathematical programs with complementarity

constraints: Stationarity, optimality, and sensitivity.Mathematics of Operations

Research 25 (2000) 1–22.

[1101] S. Scholtes. Introduction to piecewise differentiable equations. Habilitation

thesis, Institut fur Statistik und Mathematische Wirtschaftstheorie, Universitat

Karlsruhe (1994).

[1102] S. Scholtes. Homeomorphism conditions for coherently oriented piecewise

affine mappings. Mathematics of Operations Research 21 (1996) 955–978.

[1103] S. Scholtes. A proof of the branching number bound for normal manifolds.


[1104] S. Scholtes. Convergence properties of a regularization scheme for mathemati-

cal programs with complementarity constraints. SIAM Journal on Optimization

11 (2001) 918–936.

[1105] S. Scholtes and M. Stohr. Exact penalization of mathematical programs with

equilibrium constraints. SIAM Journal on Control and Optimization 37 (1999)

617–652.

[1106] S. Scholtes and M. Stohr. How stringent is the linear independence assump-

tion for mathematical programs with complementarity constraints.Mathematics


[1107] R. Schramm. On piecewise linear functions and piecewise linear equations.

Mathematics of Operations Research 5 (1980) 510-522.

[1108] A. Seeger. Eigenvalue analysis of equilibrium processes defined by linear com-

plementarity conditions. Linear Algebra and Its Applications 299 (1999) 1–14.

[1109] H. Sellami and S.M. Robinson. Homotopies based on nonsmooth equations

for solving nonlinear variational inequalities. In G. Di Pillo and F. Giannessi,

editors, Nonlinear Optimization and Applications, Plenum Press (New York

1996) pp. 329–343.

[1110] H. Sellami and S.M. Robinson. Implementation of a continuation method for

normal maps. Mathematical Programming 76 (1997) 563–578.

[1111] W. Seyfferth and F. Pfeiffer. Dynamics of assembly processes with a ma-

nipulator. Proceedings of the 1992 IEEE/RSJ International Conference on In-

telligent Robots and Systems (1992) pp. 1303–1310.

[1112] D.F. Shanno and R.J. Vanderbei. Interior-point methods for nonconvex non-

linear programming: orderings and higher-order methods. Mathematical Pro-

gramming 87 (2000) 303–316.

[1113] A. Shapiro. Sensitivity analysis of nonlinear programs and differentiability

properties of metric projections. SIAM Journal on Control and Optimization

26 (1988) 628–645.

[1114] A. Shapiro. On concepts of directional differentiability. Journal of Optimization


[1115] A. Shapiro. Perturbation analysis of optimization problems in Banach spaces.

Numerical Functional Analysis and Optimization 13 (1992) 97–116.

[1116] A. Shapiro. Directionally nondifferentiable metric projection. Journal of Opti-

mization Theory and Applications 81 (1994) 203–204.

[1117] A. Shapiro. Sensitivity analysis of parameterized programs via generalized

equations. SIAM Journal on Control and Optimization 32 (1994) 523–571.

[1118] A. Shapiro. On uniqueness of Lagrange multipliers in optimization problems

subject to cone constraints. SIAM Journal on Optimization 7 (1997) 508–518.

62 Bibliography

[1119] V. Shapiro. Theory of R-functions and applications: A primer. Technical Re-

port 91-1219, Computer Science Department, Cornell University (revised June

1991).

[1120] V. Shapiro. Real functions for representation of rigid solids. Computer-Aided

Geometric Design 11 (1994) 153–175.

[1121] V. Shapiro and I. Tsukanov. Implicit functions with guaranteed differential

properties. Proceedings of the Fifth ACM Symposium on Solid Modeling and

Applications, Ann Arbor, June 9-11, 1999.

[1122] F. Sharifi-Mokhtarian and J.L. Goffin. Long-step interior-point algorithms

for a class of variational inequalities monotone operators. Journal of Optimiza-


[1123] M. Shida, S. Shindoh, and M. Kojima. Centers of monotone generalized com-

plementarity problems.Mathematics of Operations Research 22 (1997) 969–976.

[1124] M. Shida, S. Shindoh, and M. Kojima. Existence and uniqueness of search

directions in interior-point algorithms for the SDP and the monotone SDLCP.


[1125] N.Z. Shor. Minimization Methods for Nondifferentiable Functions, Springer-

Verlag (Berlin 1985).

[1126] J.B. Shoven and A.M. Pereira. Economic equilibrium–model formulation and

solution. Journal of Economics–Zeitschrift fur Nationalokonomie 47 (1987) 88–

91.

[1127] J.B. Shoven and J. Whalley. Applying General Equilibrium. Cambridge Uni-

versity Press (New York 1992).

[1128] M. Sibony. Methodes iteratives pour les equations et inequations aux derives

partielles nonlineares de type monotone. Calcolo 7 (1970) 65–183.

[1129] A.H. Siddiqi, P. Manchanda, and M. Kocvara. An iterative two-step algo-

rithm for American option pricing. IMA Journal of Mathematics Applied in

Business and Industry 11 (2000) 71–84.

[1130] E.M. Simantiraki. Interior-Point Methods for Linear and Mixed Complemen-

tarity Problems. Ph.D. dissertation, Graduate School of Management, Rutgers


[1131] E.M. Simantiraki and D.F. Shanno. An infeasible-interior-point algorithm

for solving mixed complementarity problems. In M.C. Ferris and J.S. Pang,

editors, Complementarity and Variational Problems: State of the Art, SIAM

Publications (Philadelphia 1997) pp. 386–404.

[1132] M. Sion. On general min-max theorems. Pacific Journal of Mathematics 8 (1959)

171–176.

[1133] M.L. Slater. Lagrange multipliers revisited: A contribution to nonlinear pro-

gramming. Cowles Commission Discussion Paper, Mathematics 403, Yale Uni-

versity (November 1950).

[1134] S. Smale. A convergent process of price adjustment and global Newton methods.

Journal of Mathematical Economics 3 (1976) 107–120.

[1135] S. Smale. Algorithms for solving equations. In A.M. Gleason, editor, Proceed-

ings of the International Congress of Mathematicians, American Mathematical

Society (Providence 1987) pp. 172–195.

[1136] Y. Smeers. Computable equilibrium models and the restructuring of the Euro-

pean electricity and gas markets. Energy Journal 18 (1997) 1–31.

Bibliography 63

[1137] Y. Smeers and J.Y. Wei. Spatially oligopolistic model with opportunity cost

pricing for transmission capacity reservations–A variational inequality approach.

CORE Discussion Paper 9717, Universite Catholique de Louvain (February

1997).

[1138] M.J. Smith. The existence, uniqueness and stability of traffic equilibria. Trans-

portation Research 13B (1979) 295–304.

[1139] M.J. Smith. The existence and calculation of traffic equilibria. Transportation

Research 17B (1983) 291–303.

[1140] M.J. Smith. An algorithm for solving asymmetric equilibrium problems with a

continuous cost-flow function. Transportation Research 17B (1983) 365–371.

[1141] M.J. Smith. A descent algorithm for solving monotone variational inequalities

and monotone complementarity problems. Journal of Optimization Theory and

Applications 44 (1984) 485–496.

[1142] T.E. Smith. A solution condition for complementarity problems: with an appli-

cation to spatial price equilibrium. Applied Mathematics and Computation 15

(1984) 61–69.

[1143] T.E. Smith, T.L. Friesz, D.H. Bernstein, and Z.G. Suo. A comparative

analysis of two minimum-norm projective dynamics and their relationship to

variational inequalities. In M.C. Ferris and J.S. Pang, editors, Complementarity


1997) pp. 405–439.

[1144] A.K. Soh, X. Li, and W. Chen. Non-smooth method for three-dimensional

frictional contact problems. Manuscript, Department of Mechanical Engineer-

ing, University of Hong Kong (March 2001).

[1145] M.V. Solodov. Stationary points of bound constrained minimization reformu-

lations of complementarity problems. Journal of Optimization Theory and Ap-

plications 94 (1997) 449–467.

[1146] M.V. Solodov. Some optimization formulations of the extended complementar-

ity problem. Computational Optimization and Applications 13 (1999) 187–200.

[1147] M.V. Solodov. A class of globally convergent algorithms for pseudomonotone

variational inequalities. In M.C. Ferris, O.L. Mangasarian, and J.S. Pang, edi-

tors, Complementarity: Applications, Algorithms and Extensions, Kluwer Aca-

demic Publishers (Dordrecht 2001) pp. 297–316.

[1148] M.V. Solodov and B.F. Svaiter. A new projection method for variational

inequality problems. SIAM Journal on Control and Optimization 37 (1999) 765–

776.

[1149] M.V. Solodov and B.F. Svaiter. A hybrid projection-proximal point algo-

rithm. Journal of Convex Analysis 6 (1999) 59–70.

[1150] M.V. Solodov and B.F. Svaiter. Error bounds for proximal point subproblems

and associated inexact proximal point algorithms. Mathematical Programming

88 (2000) 371–389.

[1151] M.V. Solodov and B.F. Svaiter. An inexact hybrid generalized proximal point

algorithm and some new results on the theory of Bregman functions. Mathe-

matics of Operations Research 25 (2000) 214–230.

[1152] M.V. Solodov and B.F. Svaiter. A truly globally convergent Newton-type

method for the monotone nonlinear complementarity problem. SIAM Journal


[1153] M.V. Solodov and B.F. Svaiter. Forcing strong convergence of proximal point

iterations in a Hilbert space. Mathematical Programming 87 (2000) 189–202.

64 Bibliography

[1154] M.V. Solodov and B.F. Svaiter. A unified framework for some inexact proxi-

mal point algorithms Numerical Functional Analysis and Optimization 22 (2001)

1013–1035.

[1155] M.V. Solodov and P. Tseng. Modified projection–type methods for monotone

variational inequalities. SIAM Journal on Control and Optimization 34 (1996)

1814–1830.

[1156] M.V. Solodov and P. Tseng. Some methods based on the D-gap function

for solving monotone variational inequalities. Computational Optimization and

Applications 17 (2000) 255–277.

[1157] Y. Song. The P and Globally Uniquely Solvable Properties in Semidefinite

Linear Complementarity Problems. Ph.D. thesis, Department of Mathematics,

University of Maryland Baltimore County (2002).

[1158] Y. Song, M.S. Gowda, and G. Ravindran. On characterizations of P and

P0-properties in nonsmooth functions. Mathematics of Operations Research 25

(2000) 400–408.

[1159] J.E. Spingarn. Partial inverse of a monotone mapping. Applied Mathematics


[1160] J.E. Spingarn. Applications of the method of partial inverses to convex pro-

gramming: decomposition. Mathematical Programming 32 (1985) 199–223.

[1161] T. Srinivasan and J. Whalley. General Equilibrium Trade Policy Modelling,

MIT Press (Boston 1986).

[1162] G. Stampacchia. Formes bilineares coercives sur les ensembles convexes.

Comptes Rendus Academie Sciences Paris 258 (1964) 4413–4416.

[1163] G. Stampacchia. Variational inequalities. In Theory and Applications of Mono-

tone Operators (Proc. NATO Advanced Study Inst., Venice, 1968), Edizioni

”Oderisi” (Gubbio 1969) pp. 101–192.

[1164] G.E. Stavroulakis, P.D. Panagiotopoulos, and A.M. Al-Fahed. On the

rigid body displacements and rotations in unilateral contact problems and ap-

plications. Computers and Structures 40 (1991) 599–614.

[1165] D.E. Stewart. A high accuracy method for solving ODEs with discontinuous

right-hand side. Numerische Mathematik 58 (1990) 299–328.

[1166] D.E. Stewart. An index formula for degenerate LCPs. Linear Algebra and its


[1167] D.E. Stewart. Convergence of a time-stepping scheme for rigid-body dynam-

ics and resolution of Painleve’s problem. Archive for Rational Mechanics and

Analysis 145 (1998) 215–260.

[1168] D.E. Stewart. Rigid-body dynamics with friction and impact. SIAM Review

42 (2000) 3–39.

[1169] D.E. Stewart and J.C. Trinkle. An implicit time-stepping scheme for rigid

body dynamics with inelastic collisions and Coulomb friction. International

Journal on Numerical Methods for Engineering 39 (1996) 2673–2691.

[1170] D.E. Stewart and J.C. Trinkle. Dynamics, friction, and complementarity

problems. In M.C. Ferris and J.S. Pang, editors, Complementarity and Vari-

ational Problems: State of the Art, SIAM Publications (Philadelphia 1997)

pp. 405–424.

[1171] J. Stoer and M. Wechs. Infeasible-interior-point paths for sufficient linear

complementarity problems and their analyticity. Mathematical Programming

83 (1998) 407–423.

Bibliography 65

[1172] J. Stoer and M. Wechs. The complexity of high-order interior-point meth-

ods for solving sufficient linear complementarity problems. In Proceedings of

Approximation, Optimization and Mathematical Economics (Pointed-a-Pitre

1999), Physica (Heidelberg 2001) pp. 329–342.

[1173] J. Stoer, M. Wechs, and S. Mizuno. High-order infeasible-interior-point

methods for solving sufficient linear complementarity problems. Mathematics


[1174] J. Stoer, M. Wechs, and S. Mizuno. High-order methods for solving sufficient

linear complementarity problems. In Proceedings of the Systems Modelling and

Optimization (Detroit 1997), Chapman & Hall CRC Research Notes in Mathe-

matics 396 (Boca Raton 1999) pp. 245–252.

[1175] J. Stoer and C. Witzgall. Convexity and Optimization in Finite Dimensions

I, Springer-Verlag (Berlin 1970).

[1176] J.C. Stone. Sequential optimization and complementarity techniques for com-

puting economic equilibria. Mathematical Programming Study 23 (1985) 173–

191.

[1177] R.E. Stone. Lipschitzian matrices are nondegenerate INS-matrices. In M.C.



[1178] N. Stromberg. An augmented Lagrangian method for fretting problems. Eu-

ropean Journal of Mechanics, A/Solids 16 (2997) 573–593.

[1179] N. Stromberg, L. Johansson, and A. Klarbring. Derivation and analysis

of a generalized standard model for contact, friction and wear. International

Journal of Solids and Structures 33 (1996) 1817–1836.

[1180] P.K. Subramanian. A note on least two norm solutions of monotone comple-

mentarity problems. Applied Mathematics Letters 1 (1988) 395–397.

[1181] P.K. Subramanian. Gauss-Newton methods for the complementarity problem.


[1182] P.K. Subramanian and N.H. Xiu. Convergence analysis of Gauss-Newton

methods for the complementarity problem. Journal of Optimization Theory and

Applications 94 (1997) 727–738.

[1183] D. Sun. A projection and contraction method for the nonlinear complementarity

problem and its extensions. Mathematica Numerica Sinica 16 (1994) 183–194

(in Chinese). English translation in Chinese Journal of Numerical Mathematics


[1184] D. Sun. A new step-size skill for solving a class of nonlinear projection equations.

Journal of Computational Mathematics 13 (1995) 357–368.

[1185] D. Sun. A class of iterative methods for solving nonlinear projection equations.


[1186] D. Sun. A regularization Newton method for solving nonlinear complementarity

problems. Applied Mathematics and Optimization 40 (1999) 315–339.

[1187] D. Sun. A further result on an implicit function theorem for locally Lipschitz

functions. Operations Research Letter 28 (2001) 193–198.

[1188] D. Sun, M. Fukushima, and L. Qi. A computable generalized Hessian of the D-

gap function and Newton-type methods for variational inequality problems. In

M.C. Ferris and J.S. Pang, editors, Complementarity and Variational Problems:

State of the Art, SIAM Publications (Philadelphia 1997) pp. 452–473.

66 Bibliography

[1189] D. Sun and J. Han. Newton and quasi-Newton methods for a class of nonsmooth

equations and related problems. SIAM Journal on Optimization 7 (1997) 463–

480.

[1190] D. Sun and L. Qi. On NCP-functions. Computational Optimization and Ap-

plications 13 (1999) 201–220.

[1191] D. Sun and L. Qi. Solving variational inequality problems via smoothing-

nonsmooth reformulations. Journal of Computational and Applied Mathematics

129 (2001) 37–62.

[1192] D. Sun and J. Sun. Semismooth matrix valued functions. Mathematics of Op-


[1193] D. Sun and R.S. Womersley. A new unconstrained differentiable merit func-

tion for box constrained variational inequality problems and a damped Gauss-

Newton method. SIAM Journal on Optimization 9 (1999) 388–413.

[1194] D.C. Sun. A thermal elastica theory of piston-ring and cylinder-bore contact.

Journal of Applied Mechanics 58 (1991) 141–153.

[1195] J. Sun. On the structure of convex piecewise quadratic functions. Journal of


[1196] J. Sun. On piecewise quadratic Newton and trust region problems. Mathemat-


[1197] J. Sun, D. Sun and L. Qi. From strong semismoothness of the squared smooth-

ing matrix function to semidefinite complementarity problems. Preprint, De-

partment of Decision Sciences, National University of Singapore, Republic of

Singapore (October 2000).

[1198] J. Sun and G. Zhao. Global linear and local quadratic convergence of a long-

step adaptive-mode interior point method for some monotone variational in-

equality problems. SIAM Journal on Optimization 8 (1998) 123–139.

[1199] J. Sun and G. Zhao. Quadratic convergence of a long-step interior-point

method for nonlinear monotone variational inequality problems. Journal of Op-

timization Theory and Applications 97 (1998) 471–491.

[1200] J. Sun and G. Zhao. A quadratically convergent polynomial long-step algorithm

for a class of nonlinear monotone complementarity problems. Optimization 48

(2000) 453–475.

[1201] J. Sun and J. Zhu. A predictor-corrector method for extended linear-quadratic

programming. Computers and Operations Research 23 (1996) 755–767.

[1202] J. Sun, J. Zhu, and G. Zhao. A predictor-corrector algorithm for a class of

nonlinear saddle point problems. SIAM Journal on Control and Optimization

35 (1997) 532–551.

[1203] S.M. Sun, M.C. Natori, and K.C. Park. A computational procedure for flex-

ible beams with frictional contact constraints. International Journal for Numer-

ical Methods in Engineering 36 (1993) 3781–3800.

[1204] R. Sznajder and S. Gowda. The generalized order linear complementarity

problem. SIAM Journal on Matrix Analysis 15 (1994) 779–795.

[1205] R. Sznajder and S. Gowda. Generalization of P0-properties and P-properties,

extended vertical and horizontal linear problems. Linear Algebra and its Appli-

cations 224 (1995) 695–715.

[1206] R. Sznajder and S. Gowda. On the limiting behavior of the trajectory of

regularized solutions of a P0 complementarity problem. In M. Fukushima and

L. Qi, editors, Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and

Bibliography 67

Smoothing Methods, Kluwer Academic Publishers (Dordrecht 1999) pp. 371–

380.

[1207] R. Sznajder and M.S. Gowda. Nondegeneracy concepts for zeros of piecewise

smooth functions. Mathematics of Operations Research 23 (1998) 221–238.

[1208] K. Taji and M. Fukushima. Optimization based globally convergent methods

for the nonlinear complementarity problem. Journal of the Operations Research

Society of Japan 37 (1994) 310–331.

[1209] K. Taji and M. Fukushima. A globally convergent Newton method for solv-

ing variational inequality problems with inequality constraints. In D.Z. Zhu, L.

Qi, and R. Womersley, editors, Recent Advances in Nonsmooth Optimization,

World Scientific Publishers (River Ridge 1995) pp. 405–417.

[1210] K. Taji and M. Fukushima. A new merit function and a successive quadratic

programming algorithm for variational inequality problems. SIAM Journal on


[1211] K. Taji, M. Fukushima, and T. Ibaraki. A globally convergent Newton

method for solving strongly monotone variational inequalities. Mathematical

Programming 58 (1993) 369–383.

[1212] A. Tamir. Minimality and complementarity properties associated with Z-

functions and M-functions. Mathematical Programming 7 (1974) 17–31.

[1213] M.A. Tawhid On the local uniqueness of solutions of variational inequalities

under H-differentiability. Journal of Optimization Theory and Applications 113

(2002) 149–164.

[1214] M.A. Tawhid and M.S. Gowda. On two applications of H-differentiability to

optimization and complementarity problems. Computational Optimization and

Applications 17 (2000) 279–300.

[1215] M. Teboulle. Entropic proximal mapping with applications to nonlinear pro-

gramming. Mathematics of Operations Research 17 (1992) 670–690.

[1216] T. Terlaky. On p programming. European Journal of Operations Research

22 (1985) 70–100.

[1217] A.N. Tikhonov. Solution of incorrectly formulated problems and regularization

method. Soviet Mathematics Doklady 4 (1963) 1035–1038.

[1218] A.N. Tikhonov. On the stability of the functional optimization problem. Math-

ematical Physics 6 (1966) 631–634.

[1219] A.N. Tikhonov and V.Y. Arsenin. Solutions of Ill-Posed Problems. JohnWiley

& Sons (New York 1977).

[1220] F. Tin-Loi and M.C. Ferris. Holonomic analysis of quasibrittle fracture with

nonlinear hardening. In B.L. Karihaloo, Y.W. Mai, M.I. Ripley, and R.O.

Ritchie, editors. Advances in Fracture Research, Pergamon Press (New York

1997) pp. 2183–2190.

[1221] F. Tin-Loi and M.C. Ferris. A simple mathematical programming method to

a structural identification problem. In C.K. Choi, C.B. Yun, and H.G. Kwak,

editors. Proceedings, 7th International Conference on Computing in Civil and

Building Engineering (ICCCBE, VII), Techno Press (Taejon 1997) pp. 511–518.

[1222] F. Tin-Loi and J.S. Misa. Large displacement elastoplastic analysis of semirigid

steel frames. International Journal for Numerical Methods in Engineering 39

(1996) 741–762.

68 Bibliography

[1223] F. Tin-Loi and J.S. Pang. Elastoplastic analysis of structures with nonlin-

ear hardening. Computer Methods in Applied Mechanics and Engineering 107

(1993) 299–312.

[1224] F. Tin-Loi and V. Vimonsatit. First-order analysis of semi-rigid frames: a

parametric complementarity approach. Engineering Structures 18 (1996) 115–

124.

[1225] F. Tin-Loi and S.H. Xia. Holonomic softening: models and analysis.Mechanics

of Structures and Machines 29 (2001) 65–84.

[1226] R.L. Tobin. Sensitivity analysis for variational inequalities. Journal of Opti-

mization Theory and Applications 48 (1986) 191–204.

[1227] R.L. Tobin. A variable dimension solution approach for the general spatial

equilibrium problem. Mathematical Programming 40 (1988) 33–51.

[1228] R.L. Tobin and T.L. Friesz. Sensitivity analysis for equilibrium network flow.

Transportation Science 22 (1988) 242–250.

[1229] M.J. Todd. Computation of Fixed Points and Applications Lecture Notes in

Economics and Mathematical Systems 124, Springer-Verlag (Heidelberg 1976).

[1230] M.J. Todd. A note on computing equilibria in economics with activity model

of production. Journal of Mathematical Economics 6 (1979) 135–144.

[1231] M.J. Todd and R.H. Tutuncu. Reducing horizontal linear complementarity

problems. Linear Algebra and Its Applications 223/224 (1995) 717–729.

[1232] M.J. Todd and Y. Ye. A centered projective algorithm for linear programming.


[1233] J.C. Trinkle and J.S. Pang. Dynamic multi-rigid-body systems with con-

current distributed contacts. Proceedings of the 1997 IEEE International Con-

ference on Robotics and Automation, Albuquerque, New Mexico (1997) pp.

2276-2281.

[1234] J.C. Trinkle, J.S. Pang, S. Sudarsky, and G. Lo. On dynamic multi-rigid-

body contact problems with Coulomb friction. Zeitschrift fur Angewandte Math-

ematik und Mechanik 77 (1997) 267–279.

[1235] J.C. Trinkle, J.A. Tzitzouris, and J.S. Pang. Dynamic multi-rigid-systems

with concurrent distributed contacts. The Royal Society Philosophical Transac-

tions: Mathematical, Physical and Engineering Sciences 359 (2001) 2575–2593.

[1236] P. Tseng. Further applications of a splitting algorithm to decomposition in

variational inequalities and convex programming. Mathematical Programming

48 (1990) 249–263.

[1237] P. Tseng. Applications of a splitting algorithm to decomposition in convex

programming and variational inequalities. SIAM Journal on Control and Opti-

mization 29 (1991) 119–138.

[1238] P. Tseng. On linear convergence of iterative methods for the variational in-

equality problem. Journal of Computational and Applied Mathematics 60 (1995)

237–252.

[1239] P. Tseng. Growth behavior of a class of merit functions for the nonlinear

complementarity problem. Journal of Optimization Theory and Applications

89 (1996) 17–37.

[1240] P. Tseng. Alternating projection-proximal methods for convex programming

and variational inequalities. SIAM Journal on Optimization 7 (1997) 951–965.

[1241] P. Tseng. An infeasible path-following method for monotone complementarity

problems. SIAM Journal on Optimization 7 (1997) 386–402.

Bibliography 69

[1242] P. Tseng Merit functions for semidefinite complementarity problems. Mathe-


[1243] P. Tseng. Error bounds for regularized complementarity problems. In M. Thera

and R. Tichatschke, editors, Ill-Posed Variational Problems and Regulariza-

tion Techniques. Lecture Notes in Economics and Mathematical Systems 477,

Springer (Berlin 1999) pp. 247–274.

[1244] P. Tseng. Analysis of a non-interior continuation method based on Chen-

Mangasarian smoothing functions for complementarity problems. In M.



1999) pp. 381–404.

[1245] P. Tseng. A modified forward-backward splitting method for maximal mono-

tone mappings. SIAM Journal on Control and Optimization 38 (2000) 431–446.

[1246] P. Tseng. Error bounds and superlinear convergence analysis of some Newton-

type methods in optimization. In G. Di Pillo and F. Giannessi, editors, Nonlin-

ear Optimization and Related Topics, Kluwer Academic Publishers (Dordrecht

2000) pp. 445–462.

[1247] P. Tseng. Co-NP completeness of some matrix classification problems. Mathe-


[1248] P. Tseng, N. Yamashita, and M. Fukushima. Equivalence of complementarity

problems to differentiable minimization: a unified approach. SIAM Journal on


[1249] M. Turkay and I.E. Grossmann. Logic-based MINLP algorithms for the op-

timal synthesis of process networks. Computers and Chemical Engineering 20

(1996) 959–978.

[1250] J.A. Tzitzouris. Numerical Resolution of Frictional Multi-Rigid-Body Systems

via Fully Implicit Time-Stepping and Nonlinear Complementarity. Ph.D. dis-

sertation, Department of Mathematical Sciences, The Johns Hopkins University

(September 2001).

[1251] M. Ulbrich. Semismooth Newton methods for operator equations in function

spaces. Technical Report 00-11, Department of Computational and Applied

Mathematics, Rice University (2000).

[1252] M. Ulbrich. Nonmonotone trust-region methods for bound-constrained semis-

mooth equations with a applications to nonlinear mixed complementarity prob-

lems. SIAM Journal on Optimization 11 (2001) 889–916.

[1253] M. Ulbrich. On a nonsmooth Newton method for nonlinear complementar-

ity problems in function space with applications to optimal control. In M.C.

Ferris, O.L. Mangasarian, and J.S. Pang, editors, Complementarity: Appli-

cations, Algorithms and Extensions, Kluwer Academic Publishers (Dordrecht

2001) pp. 341–360.

[1254] C. Ursescu. Multifunctions with closed convex graph. Czechoslovak Mathemat-

ics Journal 25 (1975) 438–441.

[1255] H. Valiaho. P∗ matrices are just sufficient. Linear Algebra and its Applications239 (1996) 103–108.

[1256] G. van der Laan, D. Talman, and Z. Yang. Existence and approximation of

robust solutions of variational inequality problems over polytopes. SIAM Journal


70 Bibliography

[1257] A.J. van der Schaft and J.M. Schumacher. Complementarity modeling of

hybrid systems. IEEE Transactions on Automatic Control 43 (1998) 483–490.

[1258] L. Vandenberghe, B.L. De Moor, and J. Vandewalle. The generalized linear

complementarity problem applied to the complete analysis of resistive piecewise-

linear circuits. IEEE Transactions on Circuits and Systems 36 (1989) 1382–1391.

[1259] R.J. Vanderbei. Linear Programming: Foundations and Extensions. Kluwer

Academic Publishers (Boston 2001).

[1260] R.J. Vanderbei and D.F. Shanno. An interior-point algorithm for noncon-

vex nonlinear programming. Computational Optimization and Applications 13

(1999) 231–252.

[1261] V. Venkateswaran. An algorithm for the linear complementarity problem with

a P0 matrix. SIAM Journal on Matrix Analysis and Applications 14 (1993) 967–

977.

[1262] A. Villar. Operator Theorems with Applications to Distributive Problems and

Equilibrium Models. Lecture Notes in Economics and Mathematical Systems

377, Springer-Verlag (New York 1992).

[1263] S. Villeneuve and A. Zanette. Parabolic A.D.I. methods for pricing American

options on two stocks. Mathematics of Operations Research 27 (2002) 121–149.

[1264] J. von Neumann. Zur Theorie der Gesellschaftspspiele.Mathematische Annalen

100 (1928) 295–320.

[1265] R.R. Wakefield and F. Tin-Loi. Large scale nonholonomic elastoplastic anal-

ysis using a linear complementarity formulation. Computer Methods in Applied

Mechanics and Engineering 84 (1990) 229–242.

[1266] R.R. Wakefield and F. Tin-Loi. Large displacement elastoplastic analysis of

frames using an iterative LCP approach. International Journal of Mechanical

Science 33 (1991) 379–391.

[1267] D.W. Walkup and R.J.B. Wets. A Lipschitzian characterization of convex

polyhedra. Proceedings of the American Mathematical Society 20 (1969) 167–

173.

[1268] L. Walras. Elements d’Economie Politique Pure, L. Corbaz and Company

(Lausanne 1874). [Translated as Elements of Pure Economics by W. Jaffe,

Allen and Unwin (London 1954).]

[1269] T. Wang, R.D.C. Monteiro, and J.S. Pang. An interior point potential reduc-

tion method for constrained equations. Mathematical Programming 74 (1996)

159–196.

[1270] T. Wang and J.S. Pang. Global error bounds for convex quadratic inequality

systems. Optimization 31 (1994) 1–12.

[1271] J.G. Wardrop. Some theoretical aspects of road traffic research. Proceeding of

the Institute of Civil Engineers, Part II (1952) pp. 325–378.

[1272] L.T. Watson. Solving the nonlinear complementarity problem by a homotopy

method. SIAM Journal on Control and Optimization 17 (1979) 36–46.

[1273] J.Y. Wei and Y. Smeers. Spatial oligopolistic electricity models with Cournot

generators and regulated transmission prices. Operations Research 47 (1999)

102–112.

[1274] Z. Wei, L. Qi and H. Jiang. Some convergence properties of descent methods.


Bibliography 71

[1275] A.P. Wierzbicki. Note on the equivalence of Kuhn-Tucker complementarity

conditions to an equation. Journal of Optimization Theory and Applications 37

(1982) 401–405.

[1276] P. Wilmott, J.N. Dewynne, and S. Howison. Option Pricing: Mathematical

Models and Computation, Oxford Financial Press (Oxford 1993).

[1277] A.N. Wilson, Jr.. Useful generalization of P0 matrix concept. Numerische

Mathematik 17 (1971) 62.

[1278] A.N. Wilson, Jr.. Nonlinear Networks: Theory and Analysis, IEEE Press (New

York 1974).

[1279] R.B. Wilson. A simplicial algorithm for concave programming. Ph.D. thesis,

Graduate School of Business Administration, Harvard University (1963).

[1280] R.S. Womersley. Optimality conditions for piecewise smooth functions. Math-


[1281] S.J. Wright. Identifiable surfaces in constrained optimization. SIAM Journal


[1282] S.J. Wright. An infeasible-interior-point algorithm for linear complementarity


[1283] S.J. Wright. Primal-Dual Interior-Point Methods, SIAM Publications

(Philadelphia 1997).

[1284] S.J. Wright. Superlinear convergence of a stabilized SQP method to a degener-

ate solution. Computational Optimization and Applications 11 (1998) 253–275.

[1285] S.J. Wright. On reduced convex QP formulations of monotone LCPs. Mathe-


[1286] S.J. Wright and D. Ralph. A superlinear infeasible-interior-point algorithm

for monotone nonlinear complementarity problems. Mathematics of Operations

Research 21 (1996) 815–838.

[1287] J.H. Wu. Modified primal path-following scheme for the monotone variational

inequality problem. Journal of Optimization Theory and Applications 95 (1997)

189–208.

[1288] J.H. Wu. Long-step primal path-following algorithm for monotone variational

inequality problems. Journal of Optimization Theory and Applications 99 (1998)

509–531.

[1289] J.H. Wu and M. Florian. A simplicial decomposition method for the transit

equilibrium assignment problem. Annals of Operations Research 44 (1993) 245–

260.

[1290] J.H. Wu, M. Florian, and P. Marcotte. A general descent framework for

the monotone variational inequality problem. Mathematical Programming 61

(1993) 281–300.

[1291] S.Y. Wu, J.C. Yao, and J.S. Pang. Inexact algorithm for continuous com-

plementarity problems on measure spaces. Journal of Optimization Theory and

Applications 91 (1996) 141–154.

[1292] Z. Wu and J.J. Ye. Sufficient conditions for error bounds. SIAM Journal on

Optimization 12 (2002) 421–435.

[1293] Z. Wu and J.J. Ye. On error bounds for lower semicontinuous functions. Math-

ematical Programming (2002) 92 301–314.

[1294] B. Xiao and P.T. Harker. A nonsmooth Newton method for variational in-

equalities. I. Theory. Mathematical Programming 65 (1994) 151–194.

72 Bibliography

[1295] B. Xiao and P.T. Harker. A nonsmooth Newton method for variational in-

equalities. II. Numerical results.Mathematical Programming 65 (1994) 195–216.

[1296] N. Xiu, C. Wang, and J. Zhang. Convergence properties of projection and

contraction methods for variational inequality problems. Applied Mathematics


[1297] H. Xu. Set-valued approximations and Newton’s methods. Mathematical Pro-

gramming 84 (1999) 401–420.

[1298] S. Xu. The global linear convergence of an infeasible noninterior path-following

algorithm for complementarity problems with uniform P-functions. Mathemat-


[1299] S. Xu and J.V. Burke. A polynomial time interior-point path-following algo-

rithm for LCP based on Chen-Harker-Kanzow smoothing techniques. Mathe-


[1300] K. Yamada, N. Yamashita, and M. Fukushima. A new derivative-free descent

method for the nonlinear complementarity problem. In G. Di Pillo and F. Gi-

annessi, editors, Nonlinear Optimization and Related Topics Kluwer Academic

Publishers, (Dordrecht 2000) pp. 463-487.

[1301] T. Yamamoto. Historical developments in convergence analysis for Newton’s

and Newton-like methods. Journal of Computational and Applied Mathematics

124 (2000) 1–23.

[1302] Y. Yamamoto. Fixed point algorithms for stationary point algorithms. In M.

Iri and K. Tanabe, editors, Mathematical Programming: Recent Developments

and Applications, Kluwer Academic Publishers (Boston 1989) pp. 283–307.

[1303] N. Yamashita. Properties of restricted NCP functions for nonlinear complemen-

tarity problems. Journal of Optimization Theory and Applications 98 (1998)

701–717.

[1304] N. Yamashita, H. Dan, and M. Fukushima. On the identification of degener-

ate indices in the nonlinear complementarity problem with the proximal point

algorithm. Mathematics of Operations Research (2002) forthcoming.

[1305] N. Yamashita and M. Fukushima. On stationary points of the implicit La-

grangian for the nonlinear complementarity problem. Journal of Optimization


[1306] N. Yamashita and M. Fukushima. Equivalent unconstrained minimization and

global error bounds for variational inequality problems. SIAM Journal on Con-

trol and Optimization 35 (1997) 273–284.

[1307] N. Yamashita and M. Fukushima. Modified Newton methods for solving a

semismooth reformulation of monotone complementarity problems. Mathemat-


[1308] N. Yamashita and M. Fukushima. A new merit function and a descent method

for semidefinite complementarity problems. In M. Fukushima and L. Qi, editors,

Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing

Methods, Kluwer Academic Publishers (Dordrecht 1998) pp. 405-420.

[1309] N. Yamashita and M. Fukushima. The proximal point algorithm with gen-

uine superlinear convergence for the monotone complementarity problem. SIAM


[1310] N. Yamashita and M. Fukushima. On the level-boundedness of the natural

residual function for variational inequality problems. Manuscript, Department

of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto

University (March 2002).

Bibliography 73

[1311] N. Yamashita, J. Imai, and M. Fukushima. The proximal point algorithm

for the P0 complementarity problem. In M.C. Ferris, O.L. Mangasarian, and

J.S. Pang, editors, Complementarity: Applications, Algorithms and Extensions,


[1312] N. Yamashita, K. Taji and M. Fukushima. Unconstrained optimization refor-

mulations of variational inequality problems. Journal of Optimization Theory


[1313] Y.F. Yang and D.H. Li. Broyden’s method for solving variational inequalities

with global and superlinear convergence. Journal of Computational Mathemat-

ics 18 (2000) 289–304.

[1314] Y.F. Yang, D.H. Li, and S.Z. Zhou. A trust region method for a semismooth

reformulation to variational inequality problems. Optimization Methods and

Software 14 (2000) 139–157.

[1315] Z. Yang. A simplicial algorithm for computing robust stationary points of a

continuous function on the unit simplex. SIAM Journal on Control and Opti-

mization 34 (1996) 491–506.

[1316] J.C. Yao. The generalized quasi-variational inequality problem with applica-

tions. Journal of Mathematical Analysis and Applications 158 (1991) 139–160.

[1317] J.C. Yao. Variational inequalities with generalized monotone operators. Math-

ematics of Operations Research 19 (1994) 691–705.

[1318] J.C. Yao. Generalized-quasi-variational inequality problems with discontinuous

mappings. Mathematics of Operations Research 20 (1995) 465–478.

[1319] S.T. Yau and D.Y. Gao. Obstacle problem for von Karman equations. Ad-

vances in Applied Mathematics 13 (1992) 123–141.

[1320] J.J. Ye. Optimality conditions for optimization problems with complementarity

constraints. SIAM Journal on Optimization 9 (1999) 374–387.

[1321] J.J. Ye and X.Y. Ye. Necessary optimality conditions for optimization prob-

lems with variational inequality constraints. Mathematics of Operationa Re-

search 22 (1997) 977–997.

[1322] J.J. Ye, D.L. Zhu, and Q.J. Zhu. Exact penalization and necessary optimal-

ity conditions for generalized bilevel programming problems. SIAM Journal on


[1323] Y. Ye. A further result on the potential reduction algorithm for the P-matrix

linear complementarity problem. Technical report, Department of Management

Sciences, The University of Iowa (Iowa 1988).

[1324] Y. Ye. A fully polynomial-time approximation algorithm for computing a sta-

tionary point of the general linear complementarity problem. Mathematics Op-


[1325] Y. Ye. On homogeneous and self-dual algorithms for LCP. Mathematical Pro-

gramming 76 (1997) 211–221.

[1326] Y. Ye. Interior Point Algorithms. Theory and analysis. John Wiley & Sons, Inc.

(New York 1997).

[1327] J.J. Zaher. Conditional Modeling. Ph.D. thesis, Department of Chemical En-

gineering, Carnegie-Mellon University, Pittsburgh (May 1995).

[1328] I. Zang. A smoothing-out technique for min-max optimization. Mathematical

Programming 19 (1980) 61–77.

74 Bibliography

[1329] E.H. Zarantonello. Solving functional equations by contractive averaging.

Report 160, Mathematics Research Center, University of Wisconsin, Madison

(1960).

[1330] E.H. Zarantonello. Projections on convex sets in Hilbert space and spectral

theory I and II. In E.H. Zarantonello, editor, Contributions to Nonlinear Func-

tional Analysis, Academic Press (New York 1971) pp. 237–424.

[1331] E. Zeidler. Nonlinear Functional Analysis and its Applications III: Variational

Methods and Optimization, Springer-Verlag (New York 1985).

[1332] E. Zeidler. Nonlinear Functional Analysis and its Applications I: Fixed-point

Theorems, Springer-Verlag (New York 1986).

[1333] J. Zhang and N. Xiu. Local convergence behavior of some projection-type

methods for affine variational inequalities. Journal of Optimization Theory and

Applications 108 (2001) 205–216.

[1334] L.W. Zhang and Z.Q. Xia. Newton-type methods for quasidifferentiable equa-

tions. Journal of Optimization Theory and Applications 108 (2001) 439–456.

[1335] S. Zhang. Global error bounds for convex conic problems. SIAM Journal on

Optimization 10 (2000) 836–851.

[1336] X.L. Zhang. Numerical analysis of American option pricing in a jump-diffusion

model. Mathematics of Operations Research 22 (1997) 668–690.

[1337] Y. Zhang. On the convergence of a class of infeasible interior-point methods for

the horizontal linear complementarity problem. SIAM Journal on Optimization

4 (1994) 208–227.

[1338] G.Y. Zhao and J. Sun. On the rate of local convergence of high-order-infeasible-

path following algorithm for P∗-linear complementarity problems. Computa-tional Optimization and Applications 14 (1999) 293–307.

[1339] Y.B. Zhao. Extended projection methods for monotone variational inequalities.

Journal Optimization Theory and Applications 100 (1999) 219–231.

[1340] Y.B. Zhao and J.Y. Han. Exceptional family of elements for a variational in-

equality problem and its applications. Journal of Global Optimization 14 (1999)

313–330.

[1341] Y.B. Zhao, J.Y. Han, and H.D. Qi. Exceptional families and existence theo-

rems for variational inequality problems. Journal of Optimization Theory and

Applications 101 (1999) 475–495.

[1342] Y.B. Zhao and G. Isac. Properties of a multivalued mapping associated with

some nonmonotone complementarity problems. SIAM Journal on Control and

Optimization 39 (2000) 571–593.

[1343] Y.B. Zhao and D. Li. Strict feasibility conditions in nonlinear complementarity


[1344] Y.B. Zhao and D. Li. Existence and limiting behavior of a non-interior-point

trajectory for nonlinear complementarity problems without strict feasibility con-

dition. SIAM Journal on Control and Optimization 40 (2001) 898–924.

[1345] Y.B. Zhao and D. Li. Monotonicity of fixed point and normal mappings asso-

ciated with variational inequality and its application. SIAM Journal on Opti-

mization 11 (2001) 962–973.

[1346] Y.B. Zhao and D. Li. On a new homotopy continuation trajectory for nonlinear

complementarity problems.Mathematics of Operations Research 26 (2001) 119–

146.

Bibliography 75

[1347] Y.B. Zhao and D. Sun. Alternative theorems for nonlinear projection equations

and applications to generalized complementarity problems. Nonlinear Analysis:

Theory, Methods and Applications 46 (2001) 853-868.

[1348] C.Y. Zhu. Modified proximal point algorithm for extended linear-quadratic pro-

gramming. Computational Optimization and Applications 2 (1992) 182–205.

[1349] C.Y. Zhu and R.T. Rockafellar. Primal-dual projected gradient algorithms

for extended linear-quadratic programming. SIAM Journal on Optimization 3

(1993) 751–783.

[1350] D.L. Zhu and P. Marcotte. Modified descent methods for solving the mono-

tone variational inequality. Operations Research Letters 14 (1993) 111–120.

[1351] D.L. Zhu and P. Marcotte. An extended descent framework for variational

inequalities. Journal of Optimization Theory and Applications 80 (1994) 349–

360.

[1352] D.L. Zhu and P. Marcotte. New classes of generalized monotonicity. Journal

of Optimization Theory and Applications 87 (1995) 457–471.

[1353] D.L. Zhu and P. Marcotte. Co-coercivity and its role in the convergence of

iterative schemes for solving variational inequalities. SIAM Journal on Opti-

mization 6 (1996) 714–726.

[1354] A.I. Zincenko. Some approximate methods of solving equations with nondif-

ferentiable operators, (In Ukrainian). Dopovidi Akad. Nauk. Ukraın RSR 1963

(1963) 156–161.

[1355] S.I. Zuhovickii, R.A. Poljak, and M.E. Primak. Two methods of search for

equilibrium points of n-person concave games. Soviet Mathematics Doklady 10

(1969) 279–282.

[1356] S.I. Zuhovickii, R.A. Poljak, and M.E. Primak. Numerical methods of find-

ing equilibrium points of n-person games. In Proceedings of the First Winter

School of Mathematical Programming in Drogobych (1969) 93–130.

[1357] S.I. Zuhovickii, R.A. Poljak, and M.E. Primak. On an n-person concave

game and a production model. Soviet Mathematics Doklady 11 (1970) 522–526.

[1358] S.I. Zuhovickii, R.A. Poljak, and M.E. Primak. Concave equilibrium points:

numerical methods. Matekon 9 (1973) 10–30.

[1359] R. Zvan, P.A. Forsyth, and K.R. Vetzal. Penalty methods for American

options with stochastic volatility. Journal of Computational and Applied Math-

ematics 91 (1998) 119–218.

[1360] R. Zvan, P.A. Forsyth, and K.R. Vetzal. Robust numerical methods for

PDE models of Asian options. Journal of Computational Finance 1 (1998) 39–

78.

[1361] R. Zvan, P.A. Forsyth, and K.R. Vetzal. PDE methods for pricing barrier

options. Journal of Economic Dynamics and Control 24 (2000) 1563–1590.

BIBLIOGRAPHY - uniroma1.itfacchinei/VICPbib.pdf · 2002-11-18 · Bibliography 3 [32] M. Anitescu,...

Documents

Transcript of BIBLIOGRAPHY - uniroma1.itfacchinei/VICPbib.pdf · 2002-11-18 · Bibliography 3 [32] M. Anitescu,...