IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v269y2015icp885-903.html
   My bibliography  Save this article

A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints

Author

Listed:
  • Li, Jianling
  • Huang, Renshuai
  • Jian, Jinbao

Abstract

In this paper, based on the smoothing techniques and the working set techniques, a QP-free algorithm for mathematical programs with equilibrium constraints (MPEC for short) is presented. Firstly, by Fischer–Burmeister function and smoothing techniques, the discussed problem is approximated by a smooth constrained optimization problem. Secondly, the working set, which is used to construct systems of linear equations, is generated by pivoting operation. At each iteration, the search direction is yielded by solving two or three systems of equations with the same coefficient matrix. Under mild conditions, the global convergence and superlinear convergence are shown. Moreover, we can conclude that the current iterative point is an exact stationary point of the discussed problem if the proposed algorithm stops after finite iterations. Finally, preliminary numerical results are reported.

Suggested Citation

  • Li, Jianling & Huang, Renshuai & Jian, Jinbao, 2015. "A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 885-903.
    • Handle: RePEc:eee:apmaco:v:269:y:2015:i:c:p:885-903
    DOI: 10.1016/j.amc.2015.07.081
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315010036
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.07.081?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gui-Hua Lin & Masao Fukushima, 2005. "A Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints," Annals of Operations Research, Springer, vol. 133(1), pages 63-84, January.
    2. H. Luo & X. Sun & Y. Xu & H. Wu, 2010. "On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints," Journal of Global Optimization, Springer, vol. 46(2), pages 217-232, February.
    3. H. Z. Luo & X. L. Sun & Y. F. Xu, 2010. "Convergence Properties of Modified and Partially-Augmented Lagrangian Methods for Mathematical Programs with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 145(3), pages 489-506, June.
    4. Jian, Jin-Bao & Pan, Hua-Qin & Tang, Chun-Ming & Li, Jian-Ling, 2015. "A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 560-578.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qingna Li & Zhen Li & Alain Zemkoho, 2022. "Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 315-350, December.
    2. Li, Jianling & Yang, Zhenping, 2018. "A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 52-72.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nélida Echebest & María Daniela Sánchez & María Laura Schuverdt, 2016. "Convergence Results of an Augmented Lagrangian Method Using the Exponential Penalty Function," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 92-108, January.
    2. H. Wu & H. Luo, 2012. "Saddle points of general augmented Lagrangians for constrained nonconvex optimization," Journal of Global Optimization, Springer, vol. 53(4), pages 683-697, August.
    3. Huixian Wu & Hezhi Luo & Xiaodong Ding & Guanting Chen, 2013. "Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming," Computational Optimization and Applications, Springer, vol. 56(3), pages 531-558, December.
    4. H. Wu & H. Luo & J. Yang, 2014. "Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 59(4), pages 695-727, August.
    5. H. Luo & H. Wu & G. Chen, 2012. "On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 54(3), pages 599-618, November.
    6. Lei Guo & Gaoxi Li, 2024. "Approximation Methods for a Class of Non-Lipschitz Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1421-1445, September.
    7. Winterfeld, Anton, 2008. "Application of general semi-infinite programming to lapidary cutting problems," European Journal of Operational Research, Elsevier, vol. 191(3), pages 838-854, December.
    8. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    9. Giandomenico Mastroeni & Letizia Pellegrini & Alberto Peretti, 2021. "Some numerical aspects on a method for solving linear problems with complementarity constraints," Working Papers 16/2021, University of Verona, Department of Economics.
    10. Christian Kanzow & Alexandra Schwartz, 2015. "The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 253-275, February.
    11. H. Z. Luo & X. L. Sun & Y. F. Xu, 2010. "Convergence Properties of Modified and Partially-Augmented Lagrangian Methods for Mathematical Programs with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 145(3), pages 489-506, June.
    12. Jean-Pierre Dussault & Mounir Haddou & Abdeslam Kadrani & Tangi Migot, 2020. "On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 504-522, August.
    13. Wang, Guangmin & Gao, Ziyou & Xu, Meng & Sun, Huijun, 2014. "Joint link-based credit charging and road capacity improvement in continuous network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 1-14.
    14. Hoai An Thi & Thi Minh Tam Nguyen & Tao Pham Dinh, 2023. "On solving difference of convex functions programs with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 86(1), pages 163-197, September.
    15. Meng Xu & Guangmin Wang & Susan Grant-Muller & Ziyou Gao, 2017. "Joint road toll pricing and capacity development in discrete transport network design problem," Transportation, Springer, vol. 44(4), pages 731-752, July.
    16. Suhong Jiang & Jin Zhang & Caihua Chen & Guihua Lin, 2018. "Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints," Journal of Global Optimization, Springer, vol. 70(1), pages 223-236, January.
    17. Lei Guo & Gui-Hua Lin & Jane J. Ye, 2013. "Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 33-64, July.
    18. Li, Jianling & Yang, Zhenping, 2018. "A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 52-72.
    19. Xide Zhu & Peijun Guo, 2017. "Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(2), pages 255-275, October.
    20. Gemayqzel Bouza & Georg Still, 2007. "Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 467-483, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:269:y:2015:i:c:p:885-903. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.