Pages that link to "Item:Q5114191"

The following pages link to Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs (Q5114191):

Displaying 34 items.

• Using negative curvature in solving nonlinear programs (Q1694388) (← links)
• Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
• Adaptive regularization with cubics on manifolds (Q2039233) (← links)
• On the Burer-Monteiro method for general semidefinite programs (Q2047215) (← links)
• Sums of squares and quadratic persistence on real projective varieties (Q2119380) (← links)
• Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods (Q2155796) (← links)
• A brief introduction to manifold optimization (Q2218094) (← links)
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
• Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
• A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
• A hybrid Riemannian conjugate gradient method for nonconvex optimization problems (Q2700130) (← links)
• Nonconvex Phase Synchronization (Q2832892) (← links)
• Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
• (Q4614128) (← links)
• (Q4614130) (← links)
• (Q4638096) (← links)
• Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← 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)
• On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
• Spurious Valleys in Two-layer Neural Network Optimization Landscapes (Q5214225) (← links)
• Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
• An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
• Solving trust region subproblems using Riemannian optimization (Q6109916) (← links)
• A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← 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)
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← 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)
• Linear Programming on the Stiefel Manifold (Q6202765) (← links)
• Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs (Q6490317) (← links)