Partially B-Regular Optimization and Equilibrium Problems

Published Online:https://doi.org/10.1287/moor.1070.0262

References

  • Anitescu M. Global convergence of an elastic mode approach for a class of mathematical programs with complementarity constraints. SIAM J. Optim. (2005) 16:120–145CrossrefGoogle Scholar
  • Anitescu M., Tseng P., Wright S. J. Elastic-mode algorithms for mathematical programs with equilibrium constraints: Global convergence and stationarity properties. Math. Programming Ser. A (2007) 110:337–371CrossrefGoogle Scholar
  • Chen Y., Hobbs B. F., Leyffer S., Munson T. S. Leader-follower equilibria for electric power and NOx allowances markets. Comput. Management Sci. (2006) 3:307–330CrossrefGoogle Scholar
  • Dempe S.Foundations of Bilevel Programming (2002) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
  • Dempe S. Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization (2003) 52:333–359CrossrefGoogle Scholar
  • Ehrenmann A. Equilibrium problems with equilibrium constraints and their applications to electricity markets. (2004) . Doctoral dissertation, Judge Institute of Management Science, University of Cambridge, UKGoogle Scholar
  • Facchinei F., Pang J. S.Finite-Dimensional Variational Inequalities and Complementarity Problems (2003) (Springer-Verlag, New York) Google Scholar
  • Facchinei F., Pang J. S., Di Pillo G., Roma M. Exact penalty functions for generalized Nash problems. Large-Scale Nonlinear Optimization (2006) (Springer-Verlag, New York) 115–126CrossrefGoogle Scholar
  • Facchinei F., Fischer A., Piccialli V. Generalized Nash equilibrium problems and Newton methods. (2006) . Manuscript, Università di Roma “La Sapienza,” Department of Computer Science and Systems Sciences “A. Ruberti.”Google Scholar
  • Flegel M. L., Kanzow C. On the Guignard constraint qualification for mathematical programs with equilibrium constraints. Optimization (2005) 54:517–534CrossrefGoogle Scholar
  • Fletcher R., Leyffer S., Ralph D., Scholtes S. Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. (2006) 17(1):259–286CrossrefGoogle Scholar
  • Fukushima M., Pang J. S., Thera M., Tichatschke R. Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. Ill-Posed Variational Problems and Regularization Techniques. Lecture Notes in Economics and Mathematical Systems (1999) 477(Springer-Verlag, Berlin/Heidelberg, Germany) 99–110CrossrefGoogle Scholar
  • Fukushima M., Tseng P. An implementable active-set algorithm for computing a B-stationary point of the mathematical program with linear complementarity constraints. SIAM J. Optim. (2002) 12:724–739[With erratum.]CrossrefGoogle Scholar
  • Harker P. T. Generalized Nash games and quasivariational inequalities. Eur. J. Oper. Res. (1991) 54:81–94CrossrefGoogle Scholar
  • Hobbs B. F., Metzler C. B., Pang J. S. Strategic gaming analysis for electric power networks: An MPEC approach. IEEE Trans. Power Systems (2000) 15:638–845CrossrefGoogle Scholar
  • Hoffman A. J. On approximate solutions of systems of linear inequalities. J. Res. National Bureau of Standards (1952) 49:263–265CrossrefGoogle Scholar
  • Hu X., Ralph D. Using EPECs to model bilevel games in restructured electricity markets with locational prices. (2005) . Preprint, Judge Institute of Management Sciences, Cambridge University, Cambridge, UKGoogle Scholar
  • Krawczyk J. B., Uryasev S. Relaxation algorithms to find Nash equilibria with economic applications. Environ. Model. Assessment (2000) 5:63–73CrossrefGoogle Scholar
  • Kyparisis J. On uniqueness of Kuhn-Tucker multipliers in nonlinear programming. Math. Programming (1985) 32:242–246CrossrefGoogle Scholar
  • Leyffer S. A note on multiobjective optimization and complementarity constraints. (2005) . Preprint ANL/MCS-P1290-0905, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, ILGoogle Scholar
  • Leyffer S., Munson T. S. Solving multi-leader-follower games. (2005) . Preprint ANL/MCS-P1243-0405, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, ILGoogle Scholar
  • Luo Z. Q., Pang J. S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Mordukhovich B. Equilibrium problems with equilibrium constraints via multiobjective optimization. Optim. Methods and Softwares (2004) 19:479–492CrossrefGoogle Scholar
  • Outrata J. V. Optimality conditions for a class of mathematical programs with equilibrium constraints. Math. Oper. Res. (1999) 24:627–644LinkGoogle Scholar
  • Outrata J. V. A note on a class of equilibrium problems with equilibrium constraints. Kybernetica (2004) 40:585–594Google Scholar
  • Outrata J., Kočvara M., Zowe J.Nonsmooth Approach to Optimization Problems with Equilibrium Constraints (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Pang J. S. Computing generalized Nash equilibria. (2002) . Unpublished manuscriptGoogle Scholar
  • Pang J. S., Fukushima M. Complementarity constraint qualifications and simplified B-stationarity conditions for mathematical programs with equilibrium constraints. Comput. Optim. Appl. (1999) 13:111–136CrossrefGoogle Scholar
  • Pang J. S., Fukushima M. Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games. Comput. Management Sci. (2005) 2:21–56[With erratum.]CrossrefGoogle Scholar
  • Pang J. S., Qi L. A globally convergent Newton method for convex SC1 minimization problems. J. Optim. Theory Appl. (1995) 85:633–648CrossrefGoogle Scholar
  • Qi L., Sun J. A nonsmooth version of Newton’s method. Math. Programming (1993) 58:353–368CrossrefGoogle Scholar
  • Ralph D., Wright S. J. Some properties of regularization and penalization schemes for MPECs. Optim. Methods and Software (2004) 19:527–556CrossrefGoogle Scholar
  • Rentmeesters M. J., Tsai W. K., Lin K. J. A theory of lexicographic multi-criteria optimization. Second IEEE Internat. Conf. Engrg. Complex Comput. Systems (ICECCS’96) (1996) Montreal, Quebec, Canada:76–79CrossrefGoogle Scholar
  • Robinson S. M. Strongly regular generalized equations. Math. Oper. Res. (1980) 5:43–62LinkGoogle Scholar
  • Robinson S. M. Generalized equations and their solutions. II. Applications to nonlinear programming. Math. Programming Stud. (1982) 19:200–221CrossrefGoogle Scholar
  • Scheel H., Scholtes S. Mathematical programs with complementarity constraints: Stationarity, optimality and sensitivity. Math. Oper. Res. (2000) 25:1–22LinkGoogle Scholar
  • Su C. L. Equilibrium problems with equilibrium constraints. (2005) . Doctoral dissertation, Department of Management Science and Engineering, Stanford University, Stanford, CAGoogle Scholar
  • Su C. L. Analysis on forward market equilibrium model. Oper. Res. Lett. (2007) 35(1):74–82CrossrefGoogle Scholar
  • Uryasev S., Rubinstein R. Y. On relaxation algorithms in computation of noncooperative equilibria. IEEE Trans. Automatic Control (1994) 39:1263–1267CrossrefGoogle Scholar
  • Wang X., Kar K., Pang J. S. Achieving lexicographic max-min fair rates in random access wireless networks. Proc. 45th IEEE Conf. Decision and Control (CDC) (2006) San Diego, CACrossrefGoogle Scholar
  • Yao J. Cournot equilibrium in two-settlement electricity markets: Formulation and computation. (2006) . Doctoral dissertation, Department of Industrial Engineering and Operations Research, University of California, Berkeley, CAGoogle Scholar
  • Yao J., Adler I., Oren S. S. Modeling and computing two-settlement oligopolistic equilibrium in a congested electricity network. Oper. Res. (2006) . ForthcomingGoogle Scholar
  • Ye J. J. Optimality conditions for optimization problems with complementarity constraints. SIAM J. Optim. (1999) 9:374–387CrossrefGoogle Scholar
  • Ye J. J. Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints. SIAM J. Optim. (2000) 10:943–962CrossrefGoogle Scholar
  • Ye J. J. Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J. Math. Anal. Appl. (2005) 30:350–369CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.