Pages that link to "Item:Q1346137"
From MaRDI portal
The following pages link to Problems of distance geometry and convex properties of quadratic maps (Q1346137):
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)
- An algorithm for realizing Euclidean distance matrices (Q324865) (← links)
- The Pythagoras number of real sum of squares polynomials and sum of square magnitudes of polynomials (Q385438) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← 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)
- Polynomial diffusions on compact quadric sets (Q511135) (← 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)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
- On the S-procedure and some variants (Q857821) (← links)
- Theory of semidefinite programming for sensor network localization (Q868476) (← links)
- Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay (Q885768) (← links)
- Measure concentration in optimization (Q1365046) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- On convex generalized systems (Q1573992) (← links)
- Using negative curvature in solving nonlinear programs (Q1694388) (← links)
- Elliptic quadratic operator equations (Q1738302) (← 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)
- 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)
- An extension of the angular synchronization problem to the heterogeneous setting (Q2148952) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Distance geometry and data science (Q2192022) (← links)
- A brief introduction to manifold optimization (Q2218094) (← links)
- Sequences with minimal time-frequency uncertainty (Q2343252) (← links)
- Input design for discrimination between classes of LTI models (Q2409415) (← links)
- Optimality conditions for nonlinear semidefinite programming via squared slack variables (Q2413085) (← links)
- On the Polyak convexity principle and its application to variational analysis (Q2434218) (← links)
- On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
- Molecular conformation search by distance matrix perturbations (Q2485885) (← links)
- The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
- A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems (Q2810546) (← links)
- Linear layouts of weakly triangulated graphs (Q2821101) (← links)
- Diagonally Dominant Programming in Distance Geometry (Q2835679) (← links)
- Rank reduction for the local consistency problem (Q2861727) (← links)
- The spectral bundle method with second-order information (Q2926057) (← links)
