Please use this identifier to cite or link to this item:
|Title:||A robust SQP method for mathematical programs with linear complementarity constraints||Authors:||Liu, X.
Mathematical programs with equilibrium constraints
Sequential quadratic programming
|Issue Date:||2006||Citation:||Liu, X., Perakis, G., Sun, J. (2006). A robust SQP method for mathematical programs with linear complementarity constraints. Computational Optimization and Applications 34 (1) : 5-33. ScholarBank@NUS Repository. https://doi.org/10.1007/s10589-005-3075-y||Abstract:||The relationship between the mathematical program with linear complementarity constraints (MPLCC) and its inequality relaxation is studied. Based on this relationship, a new sequential quadratic programming (SQP) method is presented for solving the MPLCC. A certain SQP technique is introduced to deal with the possible inreasibility of quadratic programming subproblems. Global convergence results are derived without assuming the linear independence constraint qualification tor MPEC, the nondegeneracy condition, and any feasibility condition of the quadratic programming subproblems. Preliminary numerical results are reported. © 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands.||Source Title:||Computational Optimization and Applications||URI:||http://scholarbank.nus.edu.sg/handle/10635/44190||ISSN:||09266003||DOI:||10.1007/s10589-005-3075-y|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 19, 2021
WEB OF SCIENCETM
checked on Nov 11, 2021
checked on Nov 18, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.