The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach

References

• Anstreicher K., Vial J.-P. On the convergence of an infeasible primal-dual interior-point method for convex programming. Optim. Methods Software (1994) 3:273–283Crossref, Google Scholar
• Atkinson D. S., Vaidya P. M. A cutting plane algorithm for convex programming that uses analytic centers. Math. Programming (1995) 69:1–43Crossref, Google Scholar
• Auslender A.Optimisation. Méthodes numériques (1976) (Masson, Paris, France) Google Scholar
• Choi S., DeSarbo W., Harker P. Product positioning under price competition. Management Sci. (1990) 36:175–199Link, Google Scholar
• Denault M. Variational inequalities with the analytic center cutting plane method. (1998) . Ph.D. thesis, Faculty of Management, McGill University, Montréal, CanadaGoogle Scholar
• Denault M., Goffin J.-L. On a primal-dual analytic center cutting plane method for variational inequalities. Comput. Optim. Appl. (1999) 12:127–155Crossref, Google Scholar
• Denault M., Goffi n J.-L. Solving variational inequalities with a quadratic cut method: A primal-dual, jacobian-free approach. Comput. Oper. Res. (2004) 31:721–743Crossref, Google Scholar
• Dirkse S., Ferris M. (2001) . MCPLIB archive, CPNET, www.cs.wisc.edu/cpnet/Google Scholar
• Ferris M., Pang J.-S.Complementarity and Variational Problems: State of the art (1997) (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA) Google Scholar
• Goffin J.-L., Vial J.-P. Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optim. Methods Software (2002) 17:805–867Crossref, Google Scholar
• Goffin J.-L., Luo Z.-Q., Ye Y. Complexity analysis of an interior cutting plane method for convex feasibility problems. SIAM J. Optim. (1996) 6:638–652Crossref, Google Scholar
• Goffin J.-L., Marcotte P., Zhu D. An analytic center cutting plane method for pseudo-monotone variational inequalities. Oper. Res. Lett. (1997) 20:1–6Crossref, Google Scholar
• Harker P. Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Math. Programming (1988) 41:29–59Crossref, Google Scholar
• Harker P.Lectures on Computation of Equilibria with Equation-Based Methods (1993) (CORE Foundation, Louvain-la-Neuve, Belgium) CORE Lecture SeriesGoogle Scholar
• Harker P., Pang J.-S., Allgower G., Georg K. A damped Newton method for the linear complementarity problem. Computational Solution of Nonlinear Systems of Equations (1990) 26(American Mathematical Society, Providence, RI) . Lectures in Applied MathematicsGoogle Scholar
• Korpelevich G. M. The extragradient method for finding saddle points and other problems. Matecon (1976) 12:747–756Google Scholar
• Lemaréchal C., Nemirovskii A., Nesterov Y. New variants of bundle methods. Math. Programming (1995) 69:111–147Crossref, Google Scholar
• Luo Z. Q., Sun J. An analytic center based column generation algorithm for convex quadratic feasibility problems. SIAM J. Optim. (1998) 9:217–235Crossref, Google Scholar
• Luo Z. Q., Sun J. A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities. Comput. Optim. Appl. (2000) 15:167–191Crossref, Google Scholar
• Lüthi H.-J. On the solution of variational inequalities by the ellipsoid method. Math. Oper. Res. (1985) 10:515–522Link, Google Scholar
• Lüthi H.-J., Büeler B. The analytic center quadratic cut method for strongly monotone variational inequalities problems. SIAM J. Optim. (2000) 10:415–428Crossref, Google Scholar
• Lüthi H.-J., Büeler B. Approximate analytic center quadratic cut method for strongly monotone variational inequalities. Nonconvex Optimization and Its Applications (2001) 54(Kluwer Academic Publishers, Dordrecht, The Netherlands) 345–360Advances in Convex Analysis and Global Optimization (Pythagorion, 2000)Crossref, Google Scholar
• Magnanti T., Perakis G. A unifying geometric solution framework and complexity analysis for variational inequalities. Math. Programming (1995) 71:327–351Crossref, Google Scholar
• Marcotte P. Inéquations variationnelles: Motivation, algorithmes de résolution et quelques applications. (1997) . Publication CRT-97-02, Centre de Recherche sur les Transports, Université de Montréal, Montréal, CanadaGoogle Scholar
• Marcotte P., Dussault J.-P. A note on a globally convergent Newton method for solving monotone variational inequalities. Oper. Res. Lett. (1987) 6:35–42Crossref, Google Scholar
• Nagurney A.Network Economics: A Variational Inequality Approach (1993) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Nesterov Y. Introductory lectures on Convex Optimization. (1996) . Unpublished manuscript, CORE, Louvain-la-Neuve, BelgiumGoogle Scholar
• Nesterov Y., Nemirovskii A.Interior Point Polynomial Algorithms in Convex Programming: Theory and Applications (1994) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Nesterov Y., Péton O., Vial J.-P. Homogeneous analytic center cutting plane methods with approximate centers: Interior point methods. Optim. Methods Software (1999) 11–12:243–273Crossref, Google Scholar
• Nesterov Y., Vial J.-P. Homogeneous analytic center cutting plane methods for convex problems and variational inequalities. SIAM J. Optim. (1999) 9:707–728Crossref, Google Scholar
• Nocedal J., Wright S.Numerical Optimization (1999) (Springer-Verlag, New York) Springer Series in Operations ResearchCrossref, Google Scholar
• Sharifi-Mokhtarian F., Goffin J.-L. An analytic center quadratic cut method for the convex quadratic feasibility problem. Math. Programming (2002) 93:305–325Crossref, Google Scholar
• Solodov M., Tseng P. Modified projection-type methods for monotone variational inequalities. SIAM J. Control Optim. (1996) 34:1814–1830Crossref, Google Scholar
• Sonnevend G., Hoffman K. H., Hiriart-Urruty J.-B., Lemaréchal C., Zowe J. New algorithms in convex programming based on a notion of “centre” (for systems of analytic inequalities) and on rational extrapolation. Trends in Mathematical Optimization (1988) (Birkhäuser Verlag, Basel, Switzerland) 311–326Crossref, Google Scholar
• Wilmott P., Dewynne J. N., Howison S. D.Option Pricing: Mathematical Models and Computation (1993) (Oxford Financial Press, Oxford, UK) Google Scholar
• Wilmott P., Howison S., Dewynne J.The Mathematics of Financial Derivatives. A Student Introduction (1995) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Zukhovitskii S. I., Polyak R. A., Primak M. E. Two methods of search of equilibrium of n-person concave games. Soviet Math. Doklady (1969) 10:24–27Google Scholar