IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v49y2024i2p729-751.html

A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem

Author

Listed:
  • Hao Hu

    (School of Mathematical and Statistical Sciences, Clemson University, Clemson, South Carolina 29634; Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

  • Xinxin Li

    (School of Mathematics, Jilin University, Changchun 130012, China)

  • Haesol Im

    (Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

  • Henry Wolkowicz

    (Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

Abstract

We study a semismooth Newton-type method for the nearest doubly stochastic matrix problem where the nonsingularity of the Jacobian can fail. The optimality conditions for this problem are formulated as a system of strongly semismooth functions. We show that the nonsingularity of the Jacobian does not hold for this system. By exploiting the problem structure, we construct a modified two step semismooth Newton method that guarantees a nonsingular Jacobian matrix at each iteration, and that converges to the nearest doubly stochastic matrix quadratically.

Suggested Citation

  • Hao Hu & Xinxin Li & Haesol Im & Henry Wolkowicz, 2024. "A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem," Mathematics of Operations Research, INFORMS, vol. 49(2), pages 729-751, May.
    • Handle: RePEc:inm:ormoor:v:49:y:2024:i:2:p:729-751
    DOI: 10.1287/moor.2023.1382
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2023.1382
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2023.1382?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
    ---><---

    References listed on IDEAS

    as
    1. Defeng Sun & Jie Sun, 2002. "Semismooth Matrix-Valued Functions," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 150-169, February.
    2. Naomi Graham & Hao Hu & Jiyoung Im & Xinxin Li & Henry Wolkowicz, 2022. "A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2125-2143, July.
    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. Woosuk L. Jung & David Torregrosa-Belén & Henry Wolkowicz, 2025. "The $$\omega $$ ω -condition number: applications to preconditioning and low rank generalized Jacobian updating," Computational Optimization and Applications, Springer, vol. 91(1), pages 235-282, May.

    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. 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. Lennart Sinjorgo & Renata Sotirov, 2024. "On Solving MAX-SAT Using Sum of Squares," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 417-433, March.
    3. Haoming Liu & Kangkang Deng & Haoyang Liu & Zaiwen Wen, 2023. "An Entropy-Regularized ADMM For Binary Quadratic Programming," Journal of Global Optimization, Springer, vol. 87(2), pages 447-479, November.
    4. 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.
    5. Yong-Jin Liu & Li Wang, 2016. "Properties associated with the epigraph of the $$l_1$$ l 1 norm function of projection onto the nonnegative orthant," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 205-221, August.
    6. Sangho Kum & Yongdo Lim, 2010. "Penalized complementarity functions on symmetric cones," Journal of Global Optimization, Springer, vol. 46(3), pages 475-485, March.
    7. Yanmei Xu & Lanyu Lin & Yong-Jin Liu, 2025. "A Semismooth Newton-Based Augmented Lagrangian Algorithm for the Generalized Convex Nearly Isotonic Regression Problem," Mathematics, MDPI, vol. 13(3), pages 1-18, February.
    8. 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.
    9. Defeng Sun, 2006. "The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 761-776, November.
    10. J. Sun & L. W. Zhang & Y. Wu, 2006. "Properties of the Augmented Lagrangian in Nonlinear Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 129(3), pages 437-456, June.
    11. Chengjin Li, 2014. "A New Approximation of the Matrix Rank Function and Its Application to Matrix Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 569-594, November.
    12. Shiwei Wang & Chao Ding, 2024. "Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming," Computational Optimization and Applications, Springer, vol. 87(1), pages 39-81, January.
    13. Qingna Li & Donghui Li & Houduo Qi, 2010. "Newton’s Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound," Journal of Optimization Theory and Applications, Springer, vol. 147(3), pages 546-568, December.
    14. Jong-Shi Pang & Defeng Sun & Jie Sun, 2003. "Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 39-63, February.
    15. Houduo Qi, 2009. "Local Duality of Nonlinear Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 124-141, February.
    16. Shaoyan Guo & Hou-Duo Qi & Liwei Zhang, 2023. "Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications," Computational Optimization and Applications, Springer, vol. 86(3), pages 1193-1227, December.
    17. 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.
    18. 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.
    19. Jinji Yang & Jiang Hu & Chungen Shen, 2025. "A dual adaptive algorithm for matrix optimization with sparse group lasso regularization," Journal of Global Optimization, Springer, vol. 92(3), pages 737-774, July.
    20. Hao Hu & Xinxin Li & Jiageng Wu, 2023. "A note on the SDP relaxation of the minimum cut problem," Journal of Global Optimization, Springer, vol. 87(2), pages 857-876, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    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:inm:ormoor:v:49:y:2024:i:2:p:729-751. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.