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

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

Detalles Bibliográficos
Autores principales:	de Klerk, E, Dobre, C, Pasechnik, D
Formato:	Journal article
Publicado:	2011

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

Reduction of symmetric semidefinite programs using the regular representation
por: Klerk, Etienne de., et al.
Publicado: (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: (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: (2013)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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