Inscribability of a polytope is equivalent to its slack matrix having minimum rank equal to dimension plus one and can be decided by an SDP relaxation of the corresponding rank-minimization problem.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A hybrid penalty method with pseudo-projection post-processing is introduced for smooth optimization subject to multiple low-rank Hankel matrix constraints, supported by convergence analysis and efficient single-constraint computation via existing SLRA software.
citing papers explorer
-
Determining inscribability of polytopes via rank minimization based on slack matrices
Inscribability of a polytope is equivalent to its slack matrix having minimum rank equal to dimension plus one and can be decided by an SDP relaxation of the corresponding rank-minimization problem.
-
A hybrid penalty method for a class of optimization problems with multiple rank constraints
A hybrid penalty method with pseudo-projection post-processing is introduced for smooth optimization subject to multiple low-rank Hankel matrix constraints, supported by convergence analysis and efficient single-constraint computation via existing SLRA software.