Pages that link to "Item:Q1346137"
From MaRDI portal
The following pages link to Problems of distance geometry and convex properties of quadratic maps (Q1346137):
Displaying 23 items.
- The Excluded Minors for Isometric Realizability in the Plane (Q2968517) (← links)
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
- On Flattenability of Graphs (Q3452282) (← links)
- Clustering subgaussian mixtures by semidefinite programming (Q4603713) (← links)
- (Q4971907) (← links)
- Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization (Q5003213) (← links)
- An Epigraphical Approach to the Representer Theorem (Q5026403) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- (Q5053241) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← 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)
- On Representer Theorems and Convex Regularization (Q5231664) (← links)
- Exact Recovery with Symmetries for Procrustes Matching (Q5348459) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)
- A convex optimization model for finding non-negative polynomials (Q5965344) (← links)
- A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints (Q6079984) (← links)
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← links)
- Solving graph equipartition SDPs on an algebraic variety (Q6120843) (← links)
- Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization (Q6136653) (← links)
- Linear Programming on the Stiefel Manifold (Q6202765) (← links)