Numerical block diagonalization of matrix *−algebras with application to semidefinite programming

Numerical block diagonalization of matrix *−algebras with application to semidefinite programming

Detalhes bibliográficos
Main Authors:	de Klerk, E, Dobre, C, Pasechnik, D
Formato:	Journal article
Publicado em:	2011

Registos relacionados

Numerical block diagonalization of matrix - algebras with application to semidefinite programming
Por: Klerk, Etienne de., et al.
Publicado em: (2012)

On semidefinite programming relaxations of maximum k−section
Por: de Klerk, E, et al.
Publicado em: (2012)

On semidefinite programming relaxations of maximum k-section
Por: De Klerk, E, et al.
Publicado em: (2012)

On semidefinite programming relaxations of maximum k -section
Por: Klerk, Etienne de., et al.
Publicado em: (2013)

Numerical algebraic geometry and semidefinite programming
Por: Jonathan D. Hauenstein, et al.
Publicado em: (2021-08-01)

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems
Por: de Klerk, E, et al.
Publicado em: (2009)

On semidefinite programming relaxations of the traveling salesman problem
Por: Klerk, E, et al.
Publicado em: (2008)

On semidefinite programming relaxations of the traveling salesman problem
Por: Klerk, E, et al.
Publicado em: (2009)

Reduction of symmetric semidefinite programs using the regular *−representation
Por: de Klerk, E, et al.
Publicado em: (2007)

On semidefinite programming relaxations of the traveling salesman problem
Por: De Klerk, Etienne., et al.
Publicado em: (2009)

Reduction of symmetric semidefinite programs using the regular representation
Por: Klerk, Etienne de., et al.
Publicado em: (2012)

Improved lower bounds for the 2−page crossing numbers of Km‚n and Kn via semidefinite programming
Por: de Klerk, E, et al.
Publicado em: (2012)

Improved lower bounds for the 2-page crossing numbers of Km,n and Kn via semidefinite programming
Por: Klerk, E. de., et al.
Publicado em: (2013)

Dimension reduction for semidefinite programs via Jordan algebras
Por: Permenter, Frank Noble, et al.
Publicado em: (2021)

A trace bound for integer-diagonal positive semidefinite matrices
Por: Mitchell Lon
Publicado em: (2020-01-01)

Block-diagonal algebras of analytic functions on Banach spaces
Por: Taras O. G.
Publicado em: (2012-12-01)

Semidefinite Approximations of the Matrix Logarithm
Por: Fawzi, Hamza, et al.
Publicado em: (2019)

Singular Value and Matrix Norm Inequalities between Positive Semidefinite Matrices and Their Blocks
Por: Feng Zhang, et al.
Publicado em: (2024-01-01)

Subsampling algorithms for semidefinite programming
Por: Alexandre W. d'Aspremont
Publicado em: (2011-01-01)

Diagonalizing matrices over AW*-algebras
Por: Heunen, C, et al.
Publicado em: (2013)

Diagonalizing matrices over AW*−algebras
Por: Heunen, C, et al.
Publicado em: (2012)

Inference on graphs via semidefinite programming
Por: Sousa Bandeira, Afonso Jose
Publicado em: (2017)

Efficient semidefinite programming with approximate ADMM
Por: Rontsis, N, et al.
Publicado em: (2021)

Variational Quantum Algorithms for Semidefinite Programming
Por: Dhrumil Patel, et al.
Publicado em: (2024-06-01)

A New Algorithm for Positive Semidefinite Matrix Completion
Por: Fangfang Xu, et al.
Publicado em: (2016-01-01)

Block factor-width-two matrices and their applications to semidefinite and sum-of-squares optimization
Por: Zheng, Y, et al.
Publicado em: (2022)

Inequalities on the singular values of an off-diagonal block of a Hermitian matrix
Por: Li Chi-Kwong, et al.
Publicado em: (1999-01-01)

On the Burer–Monteiro method for general semidefinite programs
Por: Cifuentes, Diego
Publicado em: (2021)

An Improved Semidefinite Programming Hierarchy for Testing Entanglement
Por: Harrow, Aram W, et al.
Publicado em: (2021)

An Improved Semidefinite Programming Hierarchy for Testing Entanglement
Por: Harrow, Aram W., et al.
Publicado em: (2022)

Fast ADMM for semidefinite programs with chordal sparsity
Por: Zheng, Y, et al.
Publicado em: (2017)

A Novel Approach for Solving Semidefinite Programs
Por: Hong-Wei Jiao, et al.
Publicado em: (2014-01-01)

ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
Por: Igor Klep, et al.
Publicado em: (2012-12-01)

Chordal decomposition in rank minimized semidefinite programs with applications to subspace clustering
Por: Miller, J, et al.
Publicado em: (2020)

Block-diagonal solutions to Lyapunov inequalities and generalisations of diagonal dominance
Por: Sootla, A, et al.
Publicado em: (2018)

Latent Multi-View Semi-Nonnegative Matrix Factorization with Block Diagonal Constraint
Por: Lin Yuan, et al.
Publicado em: (2022-12-01)

On finite dimensional Nichols algebras of diagonal type
Por: Nicolás Andruskiewitsch, et al.
Publicado em: (2017-12-01)

ON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION
Por: A. Sadeghi
Publicado em: (2016-03-01)

Diagonalization of the cross-product matrix
Por: Oskar Maria Baksalary, et al.
Publicado em: (2023-12-01)

Semidefinite programming approaches to multi-contact feedback control
Por: Han, Weiqiao.
Publicado em: (2019)