Skip to main content
SpringerLink
Log in

A new smoothing scheme for mathematical programs with complementarity constraints

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we consider a mathematical program with complementarity constraints (MPCC). We present a new smoothing scheme for this problem, which makes the primal structure of the complementarity part unchanged mostly. For the new smoothing problem, we show that the linear independence constraint qualification (LICQ) holds under some conditions. We also analyze the convergence behavior of the smoothing problem, and get some sufficient conditions such that an accumulation point of stationary points of the smoothing problems is C (M, B)-stationarity respectively. Based on the smoothing problem, we establish an algorithm to solve the primal MPCC problem. Some numerical experiments are given in the paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chen Y, Florian M. The nonlinear bilevel programming problem: formulations, regularity and optimality conditions. Optimization, 1995, 32: 193–209

    Article  MATH  MathSciNet  Google Scholar 

  2. Facchiner F, Jiang H, Qi L. A smoothing method for mathematical programs with equilibrium constrains. Math Program, 1999, 85: 107–134

    Article  MathSciNet  Google Scholar 

  3. Fukushima M, Pang J S. A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Comput Optim Appl, 1998, 10: 5–34

    Article  MATH  MathSciNet  Google Scholar 

  4. Fukushima M, Pang J S. Convergence of a smoothing continuation method for mathematical problem with complementarity constraints. In: Théra M, Tichatschke R, eds. Ill Posed Variational Problems and Regularization Techniques, Lecture Notes in Economics and Mathematical Systems, vol. 477. Berlin-Heidelberg: Springer-Verlag, 1999, 105–116

    Google Scholar 

  5. Hu X, Ralph D. Convergence of a penalty method for mathematical programming with complementarity constraints. J Optim Theory Appl, 2004, 123: 365–390

    Article  MathSciNet  Google Scholar 

  6. Jiang H, Ralph D. Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM J Optim, 2000, 10: 779–808

    Article  MATH  MathSciNet  Google Scholar 

  7. Lin G H, Fukushima M. A new relaxation method for mathematical programs with complementarity constraints. J Optim Theory Appl, 2003, 118: 81–116

    Article  MATH  MathSciNet  Google Scholar 

  8. Lin G H, Fukushima M. A modified relaxation scheme for mathematical programs with complementarity constrains. Ann Oper Res, 2005, 133: 63–84

    Article  MATH  MathSciNet  Google Scholar 

  9. Luo Z Q, Pang J S, Ralph D. Mathematical Programs with Equilibrium Constrains. Cambridge: Cambridge University Press, 1996

    Google Scholar 

  10. Scheel H, Scholtes S. Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math Oper Res, 2000, 25: 1–22

    Article  MATH  MathSciNet  Google Scholar 

  11. Scholtes S. Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J Optim, 2001, 11: 918–936

    Article  MATH  MathSciNet  Google Scholar 

  12. Scholtes S, Stöhr M. Exact penalization of mathematical programs with complementarity constraints. SIAM J Control Optim, 1999, 37: 617–652

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computational Sciences, College of Science, Nanjing University of Science and Technology, Nanjing, 210094, China

    Tao Yan

Authors
  1. Tao Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tao Yan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yan, T. A new smoothing scheme for mathematical programs with complementarity constraints. Sci. China Math. 53, 1885–1894 (2010). https://doi.org/10.1007/s11425-010-3080-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-010-3080-1

Keywords

MSC(2000)

Search

Navigation