Pages that link to "Item:Q839485"
From MaRDI portal
The following pages link to Sum of squares method for sensor network localization (Q839485):
Displaying 16 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- Comparing SOS and SDP relaxations of sensor network localization (Q694515) (← links)
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (Q694528) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials (Q2230937) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- 3D genome reconstruction from partially phased Hi-C data (Q6192541) (← links)
