Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Solving clustered low-rank semidefinite programs arising from polynomial optimization ; volume:16 ; number:3 ; day:6 ; month:9 ; year:2024 ; pages:503-534 ; date:9.2024
Mathematical programming computation ; 16, Heft 3 (6.9.2024), 503-534, 9.2024
- Creator
-
Leijenhorst, Nando
Laat, David de
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s12532-024-00264-w
- URN
-
urn:nbn:de:101:1-2412092108222.846721995692
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:36 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Leijenhorst, Nando
- Laat, David de
- SpringerLink (Online service)
Other Objects (12)
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
Symmetries in semidefinite and polynomial optimization: relaxations, combinatorics, and the degree principle
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion
Efficient Simulation of Random Fields by Trigonometric Polynomial and Low‐rank Tensor
Semidefinite games
A Low-Rank Matrix Approach to Compute Polynomial Approximations of Smooth Two-Dimensional Functions
Semidefinite lineare Komplementärprobleme
Glättungsverfahren für semidefinite Programme
Proximal-stabilized semidefinite programming
Glättungsverfahren für semidefinite Programme
Low-rank Parareal: a low-rank parallel-in-time integrator
From low-rank retractions to dynamical low-rank approximation and back
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
Symmetries in semidefinite and polynomial optimization: relaxations, combinatorics, and the degree principle
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion
Efficient Simulation of Random Fields by Trigonometric Polynomial and Low‐rank Tensor
Semidefinite games
A Low-Rank Matrix Approach to Compute Polynomial Approximations of Smooth Two-Dimensional Functions
Semidefinite lineare Komplementärprobleme
Glättungsverfahren für semidefinite Programme
Proximal-stabilized semidefinite programming
Glättungsverfahren für semidefinite Programme
Low-rank Parareal: a low-rank parallel-in-time integrator
From low-rank retractions to dynamical low-rank approximation and back
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
Symmetries in semidefinite and polynomial optimization: relaxations, combinatorics, and the degree principle
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion
Efficient Simulation of Random Fields by Trigonometric Polynomial and Low‐rank Tensor
Semidefinite games
A Low-Rank Matrix Approach to Compute Polynomial Approximations of Smooth Two-Dimensional Functions
Semidefinite lineare Komplementärprobleme
Glättungsverfahren für semidefinite Programme
Proximal-stabilized semidefinite programming
Glättungsverfahren für semidefinite Programme
Low-rank Parareal: a low-rank parallel-in-time integrator