IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1951.html
   My bibliography  Save this paper

Smoothing technique and its applications in semidefinite optimization

Author

Listed:
  • NESTEROV, Yurii

Abstract

No abstract is available for this item.

Suggested Citation

  • NESTEROV, Yurii, 2007. "Smoothing technique and its applications in semidefinite optimization," LIDAM Reprints CORE 1951, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1951
    DOI: 10.1007/s10107-006-0001-8
    Note: In : Mathematical Programming, Serie A, 110, 245-259, 2007
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Zohrizadeh, Fariba & Josz, Cedric & Jin, Ming & Madani, Ramtin & Lavaei, Javad & Sojoudi, Somayeh, 2020. "A survey on conic relaxations of optimal power flow problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 391-409.
    2. Jean-Baptiste Hiriart-Urruty & Jérôme Malick, 2012. "A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 551-577, June.
    3. Alexandre d'Aspremont & Noureddine El Karoui, 2013. "Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics," Mathematics of Operations Research, INFORMS, vol. 38(2), pages 228-247, May.
    4. Pi, J. & Wang, Honggang & Pardalos, Panos M., 2021. "A dual reformulation and solution framework for regularized convex clustering problems," European Journal of Operational Research, Elsevier, vol. 290(3), pages 844-856.
    5. Gabriel Haeser & Alberto Ramos, 2020. "Constraint Qualifications for Karush–Kuhn–Tucker Conditions in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 187(2), pages 469-487, November.
    6. Jie Zhang & Xinmin Yang & Gaoxi Li & Ke Zhang, 2023. "A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ ℓ 0 regularization problem," Computational Optimization and Applications, Springer, vol. 84(3), pages 737-760, April.
    7. Quoc Tran-Dinh, 2017. "Adaptive smoothing algorithms for nonsmooth composite convex minimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 425-451, April.
    8. Vasile L. Basescu & John E. Mitchell, 2008. "An Analytic Center Cutting Plane Approach for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 529-551, August.

    More about this item

    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:cor:louvrp:1951. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.