Lower-order penalty methods for mathematical programs with complementarity constraints

Optimization Methods and Software

Volumn 19, Issue 6, 2004, Pages 693-720

  Yang, X Q ^a   Huang, X X ^a,b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b CHONGQING NORMAL UNIVERSITY   (China)

Author keywords

B stationary point; Convergence; Mathematical program with complementarity constraints; Optimality condition; Penalty function

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING;

B-STATIONARY POINT; MATHEMATICAL PROGRAM WITH COMPLEMENTARITY CONSTRAINTS; OPTIMALITY CONDITION; PENALTY FUNCTION;

MATHEMATICAL PROGRAMMING;

EID: 9944252900     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678041001697659     Document Type: Article

References (16)

1. J.P. Aubin and H. Frankowska (1990). Set-Valued Analysis. Springer, Birkhauser.
2. J.M. Borwein and D. Preiss (1987). A smooth variational principle with applications to subdifferentiability. Trans. Amer. Math. Soc., 303, 517-527.
3. F.H. Clarke, Y.S. Ledyaev and Wolenski (1995). Proximal analysis and minimization principles. Journal of Mathematical Analysis and Applications, 196, 722-735.
4. G.B. Dantzig, J. Folkman and N. Shapiro (1967). On continuity of the minimum set of a continuous function. Journal of Mathematical Analysis and Applications, 17, 519-548.
5. F. Facchinei, H. Jiang and L. Qi (1999). A smoothing method for mathematical programs with equilibrium constraints. Mathematical Programming, 85, 107-134.
6. M. Fukushima and J.S. Pang (1999). Convergence of a smoothing continuation method for mathematical programs with complementarity constraints, ill-posed variational problems and regularization techniques (Trier, 1998). Lecture Notes in Economics and Mathematical Systems, Vol. 477, pp. 99-110. Springer, Berlin.
7. M. Fukushima and P. Tseng (2001). An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints. SIAM J. Optimization, 12, 724-739.
8. X.M. Hu and D. Ralph (2001). Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints, Manuscript. University of Melbourne, Australia.
9. X.X. Huang and X.Q. Yang (2003). A unified augmented Lagrangian approach to duality and exact penalization. Mathematics of Operations Research, 28, 533-552.
10. X.X. Huang, X.Q. Yang and D.L. Zhu (2001), A Smooth Sequential Penalization Approach to Mathematical Programs with Complementarity Constraints. Preprint.
11. Z.Q. Luo, J.S. Pang and D. Ralph (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge.
12. J.V. Outrata (1994). On optimization problems with variational inequality constraints. SIAM J. Optimization, 4, 340-357.
13. J.S. Pang (1997). Error bounds in mathematical programming. Mathematical Programming, 79, 299-332.
14. S. Scholtes (2001). Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optimization, 11, 918-936.
15. S. Scholtes and Stöhr, M. (1999). Exact penalization of mathematical programs with equilibrium constraints. SIAM J. Control and Optimization, 37, 617-632.
16. H. Scheel and S. Scholtes (2000). Mathematical programs with complementarity constraints: stationarity, optimality and sensitivity. Mathematics of Operations Research, 25, 1-22.