Pages that link to "Item:Q2487849"

The following pages link to Local minima and convergence in low-rank semidefinite programming (Q2487849):

Displaying 47 items.

• A class of multilevel structured low-rank approximation arising in material processing (Q4641554) (← links)
• Adapting Regularized Low-Rank Models for Parallel Architectures (Q4646456) (← links)
• (Q4969035) (← links)
• Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← links)
• How well do local algorithms solve semidefinite programs? (Q4978006) (← links)
• Scalable Semidefinite Programming (Q4999352) (← links)
• Compressive Learning for Patch-Based Image Denoising (Q5043726) (← links)
• (Q5053241) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method (Q5081100) (← links)
• Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs (Q5114191) (← links)
• An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
• Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming (Q5214251) (← links)
• Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning (Q5214402) (← links)
• Quotient Geometry with Simple Geodesics for the Manifold of Fixed-Rank Positive-Semidefinite Matrices (Q5217101) (← links)
• Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
• Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method (Q5219696) (← 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)
• A Proximal Operator for Multispectral Phase Retrieval Problems (Q5237310) (← links)
• First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules (Q5447899) (← links)
• Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)
• Iteration-complexity of first-order augmented Lagrangian methods for convex programming (Q5962727) (← links)
• Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
• Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
• Efficient joint object matching via linear programming (Q6052052) (← links)
• An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs (Q6087061) (← links)
• Fast certifiable relative pose estimation with gravity prior (Q6099361) (← links)
• Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds (Q6116233) (← links)
• A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
• A unified approach to synchronization problems over subgroups of the orthogonal group (Q6117023) (← links)
• Solving graph equipartition SDPs on an algebraic variety (Q6120843) (← links)
• Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization (Q6136653) (← links)
• Max-Cut via Kuramoto-Type Oscillators (Q6168211) (← links)
• Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
• Low-Rank Univariate Sum of Squares Has No Spurious Local Minima (Q6176423) (← links)
• Guarantees for Spontaneous Synchronization on Random Geometric Graphs (Q6196197) (← links)
• Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs (Q6490317) (← links)
• IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (Q6498407) (← links)
• Application of fermionic marginal constraints to hybrid quantum algorithms (Q6549789) (← links)
• A Riemannian dimension-reduced second-order method with application in sensor network localization (Q6562381) (← links)
• A feasible method for general convex low-rank SDP problems (Q6573007) (← links)
• Global minimization of polynomial integral functionals (Q6573176) (← links)
• Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
• Matrix completion from a computational statistics perspective (Q6600376) (← links)
• Loraine – an interior-point solver for low-rank semidefinite programming (Q6661108) (← links)
• The effect of smooth parametrizations on nonconvex optimization landscapes (Q6665380) (← links)