Pages that link to "Item:Q2757537"

The following pages link to On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues (Q2757537):

Displaying 50 items.

• Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
• On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials (Q317123) (← links)
• Clustering and feature selection using sparse principal component analysis (Q374668) (← links)
• Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
• The Pythagoras number of real sum of squares polynomials and sum of square magnitudes of polynomials (Q385438) (← links)
• The generalized trust region subproblem (Q457202) (← links)
• Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
• Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment (Q496622) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem (Q519124) (← links)
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
• New results on Hermitian matrix rank-one decomposition (Q543410) (← links)
• A class of semidefinite programs with rank-one solutions (Q551300) (← links)
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
• Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
• Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
• Positive semidefinite rank (Q745689) (← links)
• Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
• Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
• Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← links)
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
• Semidefinite programming (Q1600854) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• Using negative curvature in solving nonlinear programs (Q1694388) (← links)
• Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
• Newsvendor games: convex optimization of centralized inventory operations (Q1939101) (← links)
• Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
• A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
• On the Burer-Monteiro method for general semidefinite programs (Q2047215) (← links)
• Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
• The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications (Q2190318) (← links)
• A brief introduction to manifold optimization (Q2218094) (← links)
• Sequences with minimal time-frequency uncertainty (Q2343252) (← links)
• A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
• Input design for discrimination between classes of LTI models (Q2409415) (← links)
• Optimality conditions for nonlinear semidefinite programming via squared slack variables (Q2413085) (← links)
• Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
• Semidefinite spectral clustering (Q2507069) (← links)
• The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
• The bundle scheme for solving arbitrary eigenvalue optimizations (Q2628175) (← links)
• Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
• A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems (Q2810546) (← links)