×

An entropic regularization approach for mathematical programs with equilibrium constraints. (English) Zbl 1074.90048

From the introduction: The equilibrium constraints in MPEC problems are usually modeled by a set of parametric variational inequalities or complementarity constraints. Although a powerful theory has been developed for variational inequalities, the parameterized setting in MPEC problems make these problems very difficult to solve. There have been different approaches to deal with this problem such as general penalization techniques, heuristics, and continuation methods.
In this paper we focus on transforming an MPEC problem into a regular nonlinear programming problem (NLP). From a practitioner’s point of view, this is quite valuable since the transformed problems can be directly solved by various optimization packages. In order to transform an MPEC problem into a nonlinear optimization problem, we use continuation methods. The idea of continuation methods is based on solving a sequence of perturbed problems. The main tool in modeling the perturbed problems is a specific smoothing function, which is used to approximate the difficult equilibrium constraints.
The contribution of this paper is two-fold: First, we try to exploit the application of an alternative smoothing function within continuation methods. The proposed smoothing function not only shows a good performance but also provides a flexible way of modeling a more general type of MPEC problem. Second, we work on a set of test problems collected from the literature. These problems are remodeled by the proposed smoothing function and then solved with a publicly available solver. Again for a practitioner, it is very valuable to be able to use a software package, since it provides a fast and efficient way for dealing with MPEC problems.

MSC:

90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C30 Nonlinear programming

Software:

Kestrel; SNOPT; AMPL
Full Text: DOI

References:

[1] Luo, Z.-. Q.; Pang, J.-. S.; Ralph, D., Mathematical Programs with Equilibrium Constraints (1997), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0898.90006
[2] Harker, P. T.; Pang, J.-. S., On the existence of optimal solutions to mathematical program with equilibrium constraints, Operations Research Letters, 7, 61-64 (1988) · Zbl 0648.90065
[3] Ishizuka Y, Aiyoshi E. Double penalty method for bilevel optimization problems. In: Anandalingam G., Friesz TL, editors. Hierarchical Optimization, Annals of Operations Research, vol. 34. Basel: Baltzer Science Publishers, 1992. p. 73-88.; Ishizuka Y, Aiyoshi E. Double penalty method for bilevel optimization problems. In: Anandalingam G., Friesz TL, editors. Hierarchical Optimization, Annals of Operations Research, vol. 34. Basel: Baltzer Science Publishers, 1992. p. 73-88. · Zbl 0756.90083
[4] Ishizuka Y, Aiyoshi E. Regularizations for two-level optimization problems. In: Advances in optimization. Berlin: Springer, 1992. p. 239-55.; Ishizuka Y, Aiyoshi E. Regularizations for two-level optimization problems. In: Advances in optimization. Berlin: Springer, 1992. p. 239-55. · Zbl 0756.90083
[5] Suwansirikul, C.; Friesz, T. L.; Robin, R. L., Equilibrium decomposed optimizationa heuristic for the continuous equilibrium network design problem, Transportation Science, 21, 254-263 (1987) · Zbl 0638.90097
[6] Friesz, T. L.; Cho, H.-. J.; Mehta, N. J.; Tobin, R. L.; Anandalingam, G., A simulated annealing approach to the network design problem with variational inequality constraints, Transportation Science, 26, 18-26 (1992) · Zbl 0764.90084
[7] Kanzow C. Some noninterior continuation methods for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications 1996;17:851-68.; Kanzow C. Some noninterior continuation methods for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications 1996;17:851-68. · Zbl 0868.90123
[8] Fukushima, M.; Pang, J.-. S., Convergence of smoothing continuation method for mathematical programs with complementarity constraints, (Thera, M.; Tichatschke, R., Ill-posed variational problems and regularization techniques. Ill-posed variational problems and regularization techniques, Lecture Notes in Economics and Mathematical Systems, vol. 477 (2000), Springer: Springer Berlin), 99-110 · Zbl 0944.65070
[9] Facchinei, F.; Jiang, H.; Qi, L., A smoothing method for mathematical programs with equilibrium constraints, Mathematical Programming, 85, 107-134 (1999) · Zbl 0959.65079
[10] Harker, P. T.; Pang, J.-. S., Finite-dimensional and variational inequality and nonlinear complementarity problemsa survey of theory, algorithms, and applications, Mathematical Programming, 48, 161-220 (1990) · Zbl 0734.90098
[11] Falk, J. E.; Liu, J., On bilevel programming, part Igeneral nonlinear cases, Mathematical Programming, 48, 47-72 (1995) · Zbl 0841.90112
[12] Chen, C.; Mangasarian, O. L., Smoothing methods for convex inequalities and linear complementarity problems, Mathematical Programming, 71, 51-69 (1995) · Zbl 0855.90124
[13] Qi, L.; Chen, X., A globally convergent successive approximation methods for nonsmooth equations, SIAM Journal on Control and Optimization, 33, 402-418 (1995) · Zbl 0833.90109
[14] Kanzow, C.; Jiang, H., A continuation method for (strongly) monotone variational inequalities, Mathematical Programming, 89, 103-125 (1998) · Zbl 0920.90131
[15] Fang, S.-. C.; Wu, S.-. Y., Solving min-max problems and linear semi-infinite programs, Computers and Mathematics with Applications, 32, 87-93 (1996) · Zbl 0860.90110
[16] Li, X.-. S.; Fang, S.-. C., On the entropic regularization method for solving min-max problems with applications, Mathematical Methods of Operations Research, 46, 119-130 (1997) · Zbl 0886.90133
[17] Fang, S.-. C.; Rajasekera, J. R.; Tsao, H.-. S., Entropy optimization and mathematical programming (1997), Kluwer Academic Publishers: Kluwer Academic Publishers Norwell · Zbl 0933.90051
[18] Cottle, R. W.; Dantzig, G. B., A generalization of the linear complementarity problem, Journal of Combinatorial Theory, 8, 79-90 (1970) · Zbl 0186.23806
[19] Scheel, H.; Scholtes, S., Mathematical programs with complementarity constraintsstationarity, optimality and sensitivity, Mathematics of Operations Research, 25, 1-22 (2000) · Zbl 1073.90557
[20] Kazarinoff, N. D., Analytic inequalities (1961), Holt, Rinehart and Winston: Holt, Rinehart and Winston New York · Zbl 0097.03801
[21] Gill PE, Murray W, Saunders MA, Drud A, Kalvelagen E. GAMS/SNOPT: an SQP algorithm for large-scale constrained optimization, 2000. http://www.gams.com/docs/solver/snopt.pdf; Gill PE, Murray W, Saunders MA, Drud A, Kalvelagen E. GAMS/SNOPT: an SQP algorithm for large-scale constrained optimization, 2000. http://www.gams.com/docs/solver/snopt.pdf
[22] Ortega, J. M.; Rheinboldt, W. C., Iterative solution of nonlinear equations in several variables (1980), Academic Press: Academic Press New York · Zbl 0241.65046
[23] Harker, P. T., Generalized Nash games and quasi-variational inequalities, European Journal of Operational Research, 54, 81-94 (1991) · Zbl 0754.90070
[24] Dolan ED, Munson TS. The Kestrel interface to the NEOS server, 2001. http://www-neos.mcs.anl.gov/neos/ftp/kestrel.ps; Dolan ED, Munson TS. The Kestrel interface to the NEOS server, 2001. http://www-neos.mcs.anl.gov/neos/ftp/kestrel.ps
[25] AMPL. AMPL home page, 2002. http://www.ampl.com; AMPL. AMPL home page, 2002. http://www.ampl.com
[26] Outrata, J.; Zowe, J., A numerical approach to optimization problems with variational inequality constraints, Mathematical Programming, 68, 105-130 (1995) · Zbl 0835.90093
[27] Riesz, T. L.; Tobin, R. L.; Chao, H.-. J.; Mehta, N. J., Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequalities, Mathematical Programming, 48, 265-284 (1990) · Zbl 0723.90070
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.