The following pages link to SDPLR (Q16913):
Displaying 50 items.
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- Sums of squares and quadratic persistence on real projective varieties (Q2119380) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography (Q2122021) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- A brief introduction to manifold optimization (Q2218094) (← links)
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al. (Q2225318) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Using a factored dual in augmented Lagrangian methods for semidefinite programming (Q2294228) (← links)
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers (Q2302834) (← links)
- Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
- Kernel based support vector machine via semidefinite programming: application to medical diagnosis (Q2379646) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- Relaxation and decomposition methods for mixed integer nonlinear programming. (Q2386510) (← links)
- Optimality conditions for nonlinear semidefinite programming via squared slack variables (Q2413085) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
- A global exact penalty for rank-constrained optimization problem and applications (Q2696914) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Riemannian Preconditioning (Q2792408) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems (Q2810546) (← links)
- (Q2810863) (← links)
- An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application (Q2879514) (← links)
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization (Q2910878) (← links)
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality (Q2954392) (← links)
- Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming (Q3012048) (← links)
- A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations (Q3079759) (← links)
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices (Q3083289) (← links)
- (Q3093399) (← links)
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (Q3164211) (← links)
- Minimizing Condition Number via Convex Programming (Q3225534) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- Scalable Low-Rank Semidefinite Programming for Certifiably Correct Machine Perception (Q3382007) (← links)
- Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion (Q3391180) (← links)
- Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
