The following pages link to Scalable Semidefinite Programming (Q4999352):
Displaying 31 items.
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix (Q4994436) (← links)
- (Q5053241) (← links)
- Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions (Q5065468) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
- A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
- Minimal energy configurations of bilayer plates as a polynomial optimization problem (Q6102080) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
- PCA Sparsified (Q6176425) (← links)
- Community detection with nodal information: likelihood and its variational approximation (Q6543838) (← links)
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems (Q6561643) (← links)
- A feasible method for general convex low-rank SDP problems (Q6573007) (← links)
- Provably faster gradient descent via long steps (Q6579999) (← links)
- The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)
- Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization (Q6599983) (← links)
- A new complexity metric for nonconvex rank-one generalized matrix completion (Q6608034) (← links)
- Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
- Optimal neural network approximation of Wasserstein gradient direction via convex optimization (Q6633046) (← links)
- Loraine – an interior-point solver for low-rank semidefinite programming (Q6661108) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)
