Pages that link to "Item:Q3083289"

The following pages link to Low-Rank Optimization on the Cone of Positive Semidefinite Matrices (Q3083289):

Displaying 50 items.

• The geometry of algorithms using hierarchical tensors (Q389600) (← links)
• Approximation bounds for sparse principal component analysis (Q484129) (← links)
• A survey on rank and inertia optimization problems of the matrix-valued function \(A+BXB^\ast\) (Q494274) (← links)
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
• Optimization on low rank nonconvex structures (Q1353375) (← links)
• Flexible low-rank statistical modeling with missing data and side information (Q1799348) (← links)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
• Solutions to 18 constrained optimization problems on the rank and inertia of the linear matrix function (Q1931014) (← links)
• Scalable incremental nonconvex optimization approach for phase retrieval (Q2023709) (← links)
• A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
• Adaptive regularization with cubics on manifolds (Q2039233) (← 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)
• Low-rank multi-parametric covariance identification (Q2114111) (← links)
• An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization (Q2188245) (← links)
• A brief introduction to manifold optimization (Q2218094) (← links)
• Mini-workshop: Computational optimization on manifolds. Abstracts from the mini-workshop held November 15--21, 2020 (online meeting) (Q2232319) (← links)
• Nonconvex weak sharp minima on Riemannian manifolds (Q2275271) (← links)
• Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers (Q2302834) (← links)
• Tangent and normal cones for low-rank matrices (Q2319935) (← links)
• A Riemannian symmetric rank-one trust-region method (Q2340330) (← links)
• Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
• Low rank approximation of the symmetric positive semidefinite matrix (Q2511200) (← links)
• Restricted Riemannian geometry for positive semidefinite matrices (Q2693707) (← links)
• Riemannian preconditioning (Q2792408) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• The problem of semidefinite least squares with low rank (Q2860694) (← links)
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality (Q2954392) (← links)
• (Q3201734) (← links)
• Scalable Low-Rank Semidefinite Programming for Certifiably Correct Machine Perception (Q3382007) (← links)
• Finding graph embeddings by incremental low-rank semidefinite programming (Q3458829) (← links)
• (Q4636985) (← links)
• (Q4636989) (← links)
• Accelerated method for optimization over density matrices in quantum state estimation (Q4643696) (← links)
• Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← links)
• Balanced Truncation for Parametric Linear Systems Using Interpolation of Gramians: A Comparison of Algebraic and Geometric Approaches (Q5014012) (← links)
• Manifold Optimization-Assisted Gaussian Variational Approximation (Q5066480) (← links)
• Fenchel Duality and a Separation Theorem on Hadamard Manifolds (Q5080506) (← links)
• Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
• (Q5214187) (← links)
• (Q5214235) (← links)
• Quotient Geometry with Simple Geodesics for the Manifold of Fixed-Rank Positive-Semidefinite Matrices (Q5217101) (← links)
• Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains (Q5222093) (← links)
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
• On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization (Q5231691) (← links)
• Global Registration of Multiple Point Clouds Using Semidefinite Programming (Q5252586) (← links)
• Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297) (← links)
• Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints (Q5358961) (← links)
• Mahalanobis Distance Learning for Person Re-identification (Q5402802) (← links)