doi.org/10.1007/s10957-024-02581-5

Preview meta tags from the doi.org website.

Linked Hostnames

26

Thumbnail

Search Engine Appearance

Google

https://doi.org/10.1007/s10957-024-02581-5

First-Order Methods for Nonnegative Trigonometric Matrix Polynomials - Journal of Optimization Theory and Applications

Optimization problems over the cone of nonnegative trigonometric matrix polynomials are common in signal processing. Traditionally, those problems are form



Bing

First-Order Methods for Nonnegative Trigonometric Matrix Polynomials - Journal of Optimization Theory and Applications

https://doi.org/10.1007/s10957-024-02581-5

Optimization problems over the cone of nonnegative trigonometric matrix polynomials are common in signal processing. Traditionally, those problems are form



DuckDuckGo

https://doi.org/10.1007/s10957-024-02581-5

First-Order Methods for Nonnegative Trigonometric Matrix Polynomials - Journal of Optimization Theory and Applications

Optimization problems over the cone of nonnegative trigonometric matrix polynomials are common in signal processing. Traditionally, those problems are form

  • General Meta Tags

    116
    • title
      First-Order Methods for Nonnegative Trigonometric Matrix Polynomials | Journal of Optimization Theory and Applications
    • charset
      UTF-8
    • X-UA-Compatible
      IE=edge
    • applicable-device
      pc,mobile
    • viewport
      width=device-width, initial-scale=1

  • Open Graph Meta Tags

    6
    • og:url
      https://link.springer.com/article/10.1007/s10957-024-02581-5
    • og:type
      article
    • og:site_name
      SpringerLink
    • og:title
      First-Order Methods for Nonnegative Trigonometric Matrix Polynomials - Journal of Optimization Theory and Applications
    • og:description
      Optimization problems over the cone of nonnegative trigonometric matrix polynomials are common in signal processing. Traditionally, those problems are formulated and solved as semidefinite programs (SDPs). However, the SDP formulation increases the dimension of the problem, resulting in large problems that are challenging to solve. In this paper we propose first-order methods that circumvent the SDP formulation and instead optimize directly within the space of trigonometric matrix polynomials. Our methods are based on a particular Bregman proximal operator. We apply our approach to two fundamental signal processing applications: to rectify a power spectrum that fails to be nonnegative and for graphical modeling of Gaussian time series. Numerical experiments demonstrate that our methods are orders of magnitude faster than an interior-point solver applied to the corresponding SDPs.

  • Twitter Meta Tags

    6
    • twitter:site
      @SpringerLink
    • twitter:card
      summary_large_image
    • twitter:image:alt
      Content cover image
    • twitter:title
      First-Order Methods for Nonnegative Trigonometric Matrix Polynomials
    • twitter:description
      Journal of Optimization Theory and Applications - Optimization problems over the cone of nonnegative trigonometric matrix polynomials are common in signal processing. Traditionally, those problems...

  • Item Prop Meta Tags

    3
    • position
      1
    • position
      2
    • position
      3

  • Link Tags

    9
    • apple-touch-icon
      /oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
    • canonical
      https://link.springer.com/article/10.1007/s10957-024-02581-5
    • icon
      /oscar-static/img/favicons/darwin/android-chrome-192x192.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-32x32.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-16x16.png

Emails

1

Links

208