link.springer.com/10.1007/s12532-019-00164-4

Preview meta tags from the link.springer.com website.

Linked Hostnames

24

Thumbnail

Search Engine Appearance

Google

https://link.springer.com/10.1007/s12532-019-00164-4

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs - Mathematical Programming Computation

We introduce Sieve-SDP, a simple facial reduction algorithm to preprocess semidefinite programs (SDPs). Sieve-SDP inspects the constraints of the problem t



Bing

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs - Mathematical Programming Computation

https://link.springer.com/10.1007/s12532-019-00164-4

We introduce Sieve-SDP, a simple facial reduction algorithm to preprocess semidefinite programs (SDPs). Sieve-SDP inspects the constraints of the problem t



DuckDuckGo

https://link.springer.com/10.1007/s12532-019-00164-4

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs - Mathematical Programming Computation

We introduce Sieve-SDP, a simple facial reduction algorithm to preprocess semidefinite programs (SDPs). Sieve-SDP inspects the constraints of the problem t

  • General Meta Tags

    123
    • title
      Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs | Mathematical Programming Computation
    • 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/s12532-019-00164-4
    • og:type
      article
    • og:site_name
      SpringerLink
    • og:title
      Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs - Mathematical Programming Computation
    • og:description
      We introduce Sieve-SDP, a simple facial reduction algorithm to preprocess semidefinite programs (SDPs). Sieve-SDP inspects the constraints of the problem to detect lack of strict feasibility, deletes redundant rows and columns, and reduces the size of the variable matrix. It often detects infeasibility. It does not rely on any optimization solver: the only subroutine it needs is Cholesky factorization, hence it can be implemented in a few lines of code in machine precision. We present extensive computational results on several problem collections from the literature, with many SDPs coming from polynomial optimization.

  • Twitter Meta Tags

    6
    • twitter:site
      @SpringerLink
    • twitter:card
      summary_large_image
    • twitter:image:alt
      Content cover image
    • twitter:title
      Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
    • twitter:description
      Mathematical Programming Computation - We introduce Sieve-SDP, a simple facial reduction algorithm to preprocess semidefinite programs (SDPs). Sieve-SDP inspects the constraints of the problem to...

  • 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/s12532-019-00164-4
    • 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

226