The following pages link to SDPLR (Q16913):
Displaying 36 items.
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming (Q5043284) (← links)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions (Q5065468) (← links)
- Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method (Q5081100) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Computation of Sum of Squares Polynomials from Data Points (Q5113128) (← links)
- An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations (Q5131960) (← links)
- Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (Q5131966) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- Free Material Optimization with Fundamental Eigenfrequency Constraints (Q5189571) (← links)
- ADMM for multiaffine constrained optimization (Q5210740) (← links)
- Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima (Q5215520) (← links)
- Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
- Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method (Q5219696) (← 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)
- Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold (Q5236625) (← 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)
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385033) (← links)
- First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules (Q5447899) (← links)
- Solving Lift-and-Project Relaxations of Binary Integer Programs (Q5470217) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming (Q5704081) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711486) (← links)
- (Q5717954) (← links)
- The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems (Q5737722) (← links)
- Orientation estimation of cryo-EM images using projected gradient descent method (Q5885761) (← links)
- Worst-case CVaR based portfolio optimization models with applications to scenario planning (Q5891578) (← links)
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming (Q5962727) (← links)
