IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v49y2011i1p61-99.html

A class of nonlinear Lagrangians for nonconvex second order cone programming

Author

Listed:
  • Liwei Zhang

  • Jian Gu
  • Xiantao Xiao

Abstract

No abstract is available for this item.

Suggested Citation

  • Liwei Zhang & Jian Gu & Xiantao Xiao, 2011. "A class of nonlinear Lagrangians for nonconvex second order cone programming," Computational Optimization and Applications, Springer, vol. 49(1), pages 61-99, May.
    • Handle: RePEc:spr:coopap:v:49:y:2011:i:1:p:61-99
    DOI: 10.1007/s10589-009-9279-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-009-9279-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-009-9279-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

    for a different version of it.

    References listed on IDEAS

    as
    1. A. Auslender & R. Cominetti & M. Haddou, 1997. "Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 43-62, February.
    2. 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.
    3. R. Polyak & I. Griva, 2004. "Primal-Dual Nonlinear Rescaling Method for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 111-156, July.
    4. 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.
    5. Roman Polyak, 2001. "Log-Sigmoid Multipliers Method in Constrained Optimization," Annals of Operations Research, Springer, vol. 101(1), pages 427-460, January.
    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. M. V. Dolgopolik, 2018. "Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property," Journal of Global Optimization, Springer, vol. 71(2), pages 237-296, June.
    2. Jinchuan Zhou & Jein-Shan Chen, 2015. "On the existence of saddle points for nonlinear second-order cone programming problems," Journal of Global Optimization, Springer, vol. 62(3), pages 459-480, July.
    3. M.V. Dolgopolik, 2025. "Convergence analysis of primal-dual augmented Lagrangian methods and duality theory," Journal of Global Optimization, Springer, vol. 93(2), pages 359-411, 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. M. V. Dolgopolik, 2018. "Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property," Journal of Global Optimization, Springer, vol. 71(2), pages 237-296, June.
    2. M.V. Dolgopolik, 2025. "Convergence analysis of primal-dual augmented Lagrangian methods and duality theory," Journal of Global Optimization, Springer, vol. 93(2), pages 359-411, October.
    3. 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.
    4. Sangho Kum & Yongdo Lim, 2010. "Penalized complementarity functions on symmetric cones," Journal of Global Optimization, Springer, vol. 46(3), pages 475-485, March.
    5. 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.
    6. Bruno F. Lourenço & Ellen H. Fukuda & Masao Fukushima, 2018. "Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1233-1251, November.
    7. Da Tian, 2014. "An entire space polynomial-time algorithm for linear programming," Journal of Global Optimization, Springer, vol. 58(1), pages 109-135, January.
    8. S. H. Pan & J.-S. Chen, 2009. "Growth Behavior of Two Classes of Merit Functions for Symmetric Cone Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 167-191, April.
    9. Xiangjing Liu & Sanyang Liu, 2020. "A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian $$P_0$$ P 0 -property," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(2), pages 229-247, October.
    10. 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.
    11. Nan Lu & Zheng-Hai Huang, 2014. "A Smoothing Newton Algorithm for a Class of Non-monotonic Symmetric Cone Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 446-464, May.
    12. Felipe Alvarez & Miguel Carrasco & Karine Pichard, 2005. "Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 966-984, November.
    13. Angelia Nedić & Asuman Ozdaglar, 2008. "Separation of Nonconvex Sets with General Augmenting Functions," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 587-605, August.
    14. 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.
    15. Ana Maria A. C. Rocha & M. Fernanda P. Costa & Edite M. G. P. Fernandes, 2017. "On a smoothed penalty-based algorithm for global optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 561-585, November.
    16. 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.
    17. R. Polyak & I. Griva, 2004. "Primal-Dual Nonlinear Rescaling Method for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 111-156, July.
    18. M. Gonçalves & J. Melo & L. Prudente, 2015. "Augmented Lagrangian methods for nonlinear programming with possible infeasibility," Journal of Global Optimization, Springer, vol. 63(2), pages 297-318, October.
    19. Mounir Haddou & Patrick Maheux, 2014. "Smoothing Methods for Nonlinear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 711-729, March.
    20. Enzo Busseti & Walaa M. Moursi & Stephen Boyd, 2019. "Solution refinement at regular points of conic problems," Computational Optimization and Applications, Springer, vol. 74(3), pages 627-643, December.

    More about this item

    Keywords

    ;
    ;
    ;

    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:spr:coopap:v:49:y:2011:i:1:p:61-99. 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.