IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v146y2010i1d10.1007_s10957-010-9654-9.html
   My bibliography  Save this article

An Inexact SQP Newton Method for Convex SC1 Minimization Problems

Author

Listed:
  • Y. D. Chen

    (Royal Bank of Scotland, 38/F, Cheung Kong Center)

  • Y. Gao

    (National University of Singapore)

  • Y.-J. Liu

    (Shenyang Institute of Aeronautical Engineering)

Abstract

In this paper, we present a globally and superlinearly convergent inexact SQP Newton method for solving large scale convex SC 1 minimization problems under mild conditions. In particular, the BD-regularity assumption made by Pang and Qi in Journal of Optimization Theory and Applications, 85 (1995), pp. 633–648 is replaced by a much more realistic assumption. Our numerical experiments conducted on least squares semidefinite programming with lower and upper bounds demonstrate that our inexact SQP Newton method is much more efficient than its exact version and is competitive with existing methods when the number of simple constraints is very large.

Suggested Citation

  • Y. D. Chen & Y. Gao & Y.-J. Liu, 2010. "An Inexact SQP Newton Method for Convex SC1 Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 33-49, July.
    • Handle: RePEc:spr:joptap:v:146:y:2010:i:1:d:10.1007_s10957-010-9654-9
    DOI: 10.1007/s10957-010-9654-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-010-9654-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-010-9654-9?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. Defeng Sun & Jie Sun, 2008. "Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 421-445, May.
    2. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, February.
    3. Defeng Sun & Jie Sun, 2002. "Semismooth Matrix-Valued Functions," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 150-169, February.
    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. A. Izmailov & A. Pogosyan, 2012. "Active-set Newton methods for mathematical programs with vanishing constraints," Computational Optimization and Applications, Springer, vol. 53(2), pages 425-452, October.

    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. Houduo Qi, 2009. "Local Duality of Nonlinear Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 124-141, February.
    2. Youyicun Lin & Shenglong Hu, 2022. "$${\text {B}}$$ B -Subdifferential of the Projection onto the Generalized Spectraplex," Journal of Optimization Theory and Applications, Springer, vol. 192(2), pages 702-724, February.
    3. Nooshin Movahedian, 2014. "Nonsmooth Calculus of Semismooth Functions and Maps," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 415-438, February.
    4. Chungen Shen & Yunlong Wang & Wenjuan Xue & Lei-Hong Zhang, 2021. "An accelerated active-set algorithm for a quadratic semidefinite program with general constraints," Computational Optimization and Applications, Springer, vol. 78(1), pages 1-42, January.
    5. S. H. Kum & Y. D. Lim, 2009. "Coercivity and Strong Semismoothness of the Penalized Fischer-Burmeister Function for the Symmetric Cone Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 377-383, August.
    6. Shenglong Hu & Guoyin Li, 2021. "$${\text {B}}$$ B -subdifferentials of the projection onto the matrix simplex," Computational Optimization and Applications, Springer, vol. 80(3), pages 915-941, December.
    7. Lingchen Kong & Levent Tunçel & Naihua Xiu, 2011. "Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 364-389, February.
    8. John Duggan & Tasos Kalandrakis, 2011. "A Newton collocation method for solving dynamic bargaining games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(3), pages 611-650, April.
    9. H. Xu & B. M. Glover, 1997. "New Version of the Newton Method for Nonsmooth Equations," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 395-415, May.
    10. M. L. Flegel & C. Kanzow, 2007. "Equivalence of Two Nondegeneracy Conditions for Semidefinite Programs," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 381-397, December.
    11. Sanja Rapajić & Zoltan Papp, 2017. "A nonmonotone Jacobian smoothing inexact Newton method for NCP," Computational Optimization and Applications, Springer, vol. 66(3), pages 507-532, April.
    12. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    13. C. Kanzow & H. Qi & L. Qi, 2003. "On the Minimum Norm Solution of Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 116(2), pages 333-345, February.
    14. Kenji Ueda & Nobuo Yamashita, 2012. "Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 450-467, February.
    15. Jingyong Tang & Hongchao Zhang, 2021. "A Nonmonotone Smoothing Newton Algorithm for Weighted Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 679-715, June.
    16. Sangho Kum & Yongdo Lim, 2010. "Penalized complementarity functions on symmetric cones," Journal of Global Optimization, Springer, vol. 46(3), pages 475-485, March.
    17. Y. Gao, 2004. "Representation of the Clarke Generalized Jacobian via the Quasidifferential," Journal of Optimization Theory and Applications, Springer, vol. 123(3), pages 519-532, December.
    18. J. Chen & L. Qi, 2010. "Pseudotransient Continuation for Solving Systems of Nonsmooth Equations with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 147(2), pages 223-242, November.
    19. Alain B. Zemkoho & Shenglong Zhou, 2021. "Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 625-674, March.
    20. Shaohua Pan & Jein-Shan Chen & Sangho Kum & Yongdo Lim, 2011. "The penalized Fischer-Burmeister SOC complementarity function," Computational Optimization and Applications, Springer, vol. 49(3), pages 457-491, July.

    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:spr:joptap:v:146:y:2010:i:1:d:10.1007_s10957-010-9654-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.