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

Smoothing technique and its applications in semidefinite optimization

Author

Listed:
  • NESTEROV, Yurii

Abstract

In this paper we extend the smoothing technique [7], [9] onto the problems of Semidefinite Optimization. For that, we develop a simple framework for estimating a Lipschitz constant for the gradient of some symmetric functions of eigenvalues of symmetric matrices. Using this technique, we can justify the Lipshitz constants for some natural approximations of maximal eigenvalue and the spectral radius of symmetric matrices. We analyze the complexity of the problem-oriented gradient-type schemes onto the problems of minimizing the maximal eigenvalue or the spectral radius of the matrix, which depends linearly on the design variables. We show that in the first case the number of iterations of the method is bounded by O( 1/E), where E is the required absolute accuracy of the problem. In the second case, the number of iterations is bounded by 4/[delta] sq.(1 + [delta])r ln r, where [delta] is the required relative accuracy and r is the maximal rank of corresponding linear matrix inequality. Thus, the latter method is a fully polynomial approximation scheme.

Suggested Citation

  • NESTEROV, Yurii, 2004. "Smoothing technique and its applications in semidefinite optimization," LIDAM Discussion Papers CORE 2004073, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvco:2004073
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp2004.html
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. NESTEROV, Yu, 2003. "Unconstrained convex minimization in relative scale," LIDAM Discussion Papers CORE 2003096, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. NESTEROV, Yurii, 2003. "Excessive gap technique in non-smooth convex minimization," LIDAM Discussion Papers CORE 2003035, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Peter Richtárik, 2012. "Approximate Level Method for Nonsmooth Convex Minimization," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 334-350, February.
    2. NESTEROV, Yu, 2003. "Dual extrapolation and its applications for solving variational inequalities and related problems," LIDAM Discussion Papers CORE 2003068, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. NESTEROV, Yu, 2004. "Rounding of convex sets and efficient gradient methods for linear programming problems," LIDAM Discussion Papers CORE 2004004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    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:louvco:2004073. 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: 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.