IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v76y2012i2p129-145.html
   My bibliography  Save this article

A semismooth Newton method for nonlinear symmetric cone programming

Author

Listed:
  • Lingchen Kong
  • Qingmin Meng

Abstract

In this paper, we employ the projection operator to design a semismooth Newton algorithm for solving nonlinear symmetric cone programming (NSCP). The algorithm is computable from theoretical standpoint and is proved to be locally quadratically convergent without assuming strict complementarity of the solution to NSCP. Copyright Springer-Verlag 2012

Suggested Citation

  • Lingchen Kong & Qingmin Meng, 2012. "A semismooth Newton method for nonlinear symmetric cone programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 129-145, October.
  • Handle: RePEc:spr:mathme:v:76:y:2012:i:2:p:129-145
    DOI: 10.1007/s00186-012-0393-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-012-0393-6
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s00186-012-0393-6?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. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, February.
    2. S. H. Schmieta & F. Alizadeh, 2001. "Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 543-564, August.
    Full references (including those not matched with items on IDEAS)

    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. Xiao-Hong Liu & Zheng-Hai Huang, 2009. "A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(2), pages 385-404, October.
    2. Dong-Hui Li & Liqun Qi & Judy Tam & Soon-Yi Wu, 2004. "A Smoothing Newton Method for Semi-Infinite Programming," Journal of Global Optimization, Springer, vol. 30(2), pages 169-194, November.
    3. 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.
    4. Liang Chen & Anping Liao, 2020. "On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 248-265, October.
    5. Cardoso, Domingos Moreira & Vieira, Luis Almeida, 2006. "On the optimal parameter of a self-concordant barrier over a symmetric cone," European Journal of Operational Research, Elsevier, vol. 169(3), pages 1148-1157, March.
    6. 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.
    7. Ralf Münnich & Ekkehard Sachs & Matthias Wagner, 2012. "Calibration of estimator-weights via semismooth Newton method," Journal of Global Optimization, Springer, vol. 52(3), pages 471-485, March.
    8. Y. Gao, 2006. "Newton Methods for Quasidifferentiable Equations and Their Convergence," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 417-428, December.
    9. 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.
    10. J. Han & D. Sun, 1997. "Newton and Quasi-Newton Methods for Normal Maps with Polyhedral Sets," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 659-676, September.
    11. 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.
    12. M. A. Tawhid & J. L. Goffin, 2008. "On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability," Journal of Optimization Theory and Applications, Springer, vol. 139(1), pages 127-140, October.
    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. D. H. Li & N. Yamashita & M. Fukushima, 2001. "Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming," Journal of Optimization Theory and Applications, Springer, vol. 109(1), pages 123-167, April.
    15. 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.
    16. Jingyong Tang & Jinchuan Zhou, 2021. "A smoothing quasi-Newton method for solving general second-order cone complementarity problems," Journal of Global Optimization, Springer, vol. 80(2), pages 415-438, June.
    17. Francisco Facchinei & Christian Kanzow, 2010. "Generalized Nash Equilibrium Problems," Annals of Operations Research, Springer, vol. 175(1), pages 177-211, March.
    18. Zhengyong Zhou & Yunchan Peng, 2019. "The locally Chen–Harker–Kanzow–Smale smoothing functions for mixed complementarity problems," Journal of Global Optimization, Springer, vol. 74(1), pages 169-193, May.
    19. 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.
    20. Abhishek Singh & Debdas Ghosh & Qamrul Hasan Ansari, 2024. "Inexact Newton Method for Solving Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 201(3), pages 1333-1363, June.

    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:mathme:v:76:y:2012:i:2:p:129-145. 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.