✦ LIBER ✦

Global Convergence of a Smooth Approximation Method for Mathematical Programs with Complementarity Constraints

✍ Scribed by Hongxia Yin; Jianzhong Zhang

Publisher: Springer
Year: 2006
Tongue: English
Weight: 172 KB
Volume: 64
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s00186-006-0076-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A globally convergent approximately acti

A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints

✍ J. Z. Zhang; G. S. Liu; S. Y. Wang 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 187 KB

Convergence of a Penalty Method for Math

Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints

✍ X. M. Hu; D. Ralph 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 166 KB

Global Optimization Method for Solving M

Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints

✍ N. V. Thoai; Y. Yamamoto; A. Yoshise 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 164 KB

Convergence analysis of an augmented Lag

Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints

✍ X.Q. Yang; X.X. Huang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 133 KB

In this paper, a mathematical program with complementarity constraints (MPCC) is reformulated as a nonsmooth constrained optimization problem by using the Fischer-Burmeister function. An augmented (proximal) Lagrangian method is applied to tackle the resulting constrained optimization problem. The a

Convergence Properties of a Smoothing Ap

Convergence Properties of a Smoothing Approach for Mathematical Programs with Second-Order Cone Complementarity Constraints

✍ Yi Zhang; Liwei Zhang; Jia Wu 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 623 KB

Modified relaxation method for mathemati

Modified relaxation method for mathematical programs with complementarity constraints

✍ Gui-Hua Lin 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract In this paper, we suggest a new relaxation method for solving mathematical programs with complementarity constraints. This method can be regarded as a modification of a method proposed in a recent paper (__J. Opt. Theory Appl.__ 2003; **118**:81–116). We show that the main results remai