Cover Image

Solving exact and noisy rank-one tensor completion with semidefinite programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cifuentes, Diego, Li, Zhuorui
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C22, 90C25, 15A69
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
by: Cifuentes, Diego, et al.
Published: (2026)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
by: Tang, Tianyun, et al.
Published: (2024)

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

A semidefinite programming characterization of the Crawford number
by: Friedland, Shmuel, et al.
Published: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
by: Namchaisiri, Charles, et al.
Published: (2024)

On generators of $k$-PSD closures of the positive semidefinite cone
by: Bhardwaj, Avinash, et al.
Published: (2024)

Copositivity criteria of a class of fourth order 3-dimensional symmetric tensors
by: Song, Yisheng, et al.
Published: (2023)

Solving clustered low-rank semidefinite programs arising from polynomial optimization
by: Leijenhorst, Nando, et al.
Published: (2022)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
by: Monteiro, Renato D. C., et al.
Published: (2024)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
by: Barkel, Mathijs, et al.
Published: (2026)

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
by: Friedland, Shmuel, et al.
Published: (2023)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
by: Vervliet, Nico, et al.
Published: (2020)

Copositive and completely positive cones over symmetric cones of rank at least 5
by: Nishijima, Mitsuhiro
Published: (2026)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
by: Zhang, Rui-Jin, et al.
Published: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Strict Copositivity for a Class of 3rd Order Symmetric Tensors
by: Li, Min, et al.
Published: (2024)

A semidefinite programming hierarchy for covering problems in discrete geometry
by: Riener, Cordian, et al.
Published: (2023)

Convergence rates of S.O.S hierarchies for polynomial semidefinite programs
by: Tran, Hoang Anh, et al.
Published: (2024)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)

Dual dynamic programming for stochastic programs over an infinite horizon
by: Ju, Caleb, et al.
Published: (2023)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
by: Wang, Jie
Published: (2022)

On Second-Order Cone Functions
by: Jibrin, Shafiu, et al.
Published: (2023)

Positive Definiteness of $4$th Order $3$-Dimensional Symmetric Tensors with entries $-1$, $0$, $1$
by: Ye, Li, et al.
Published: (2025)

Barrier relaxations of the classical and quantum optimal transport problems
by: Friedland, Shmuel
Published: (2025)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
by: Kharitenko, Andrey, et al.
Published: (2025)

Interval B-Tensors and Interval Double B-Tensors
by: Ye, Li, et al.
Published: (2026)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

Everything is possible: constructing spectrahedra with prescribed facial dimensions
by: Roshchina, Vera, et al.
Published: (2023)

Riemannian preconditioned coordinate descent for low multi-linear rank approximation
by: Hamed, Mohammad, et al.
Published: (2021)

Quantum Optimal Transport
by: Cole, Sam, et al.
Published: (2021)