Article Contents
Article Contents

# A smoothing Newton algorithm for mathematical programs with complementarity constraints

• We propose a smoothing Newton algorithm for solving mathematical programs with complementarity constraints (MPCCs). Under some reasonable conditions, the proposed algorithm is shown to be globally convergent and to generate a $B$-stationary point of the MPCC. Preliminary numerical results on some MacMPEC problems are reported.
Mathematics Subject Classification: Primary 90C30, 90C33, 65K10.

 Citation:

• on this site

/