No article text was recorded for this version.
correlative sparsity exploitation
Version 1 of 151 papers65 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Polar Operators for Structured Sparse Estimation
- Blog: Sparse noncommutative polynomial optimization
- Blog: Certified Roundoff Error Bounds Using Bernstein Expansions and Sparse Krivine-Stengle Representations
- Blog: A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems
- Blog: State polynomials: positivity, optimization and nonlinear Bell inequalities
- Blog: Sparse sum-of-squares (SOS) optimization: A bridge between DSOS/SDSOS and SOS optimization for sparse polynomials
- Blog: Certifiable Outlier-Robust Geometric Perception: Exact Semidefinite Relaxations and Scalable Global Optimization
- Blog: Exploiting Constant Trace Property in Large-scale Polynomial Optimization
- Blog: One Ring to Rule Them All: Certifiably Robust Geometric Perception with Outliers
- Blog: Convex Relaxation for Solving Large-Margin Classifiers in Hyperbolic Space
- Blog: In Perfect Shape: Certifiably Optimal 3D Shape Reconstruction From 2D Landmarks
- Blog: A Sparse Version of Reznick's Positivstellensatz
- Blog: Bounding the Distance to Unsafe Sets With Convex Optimization
- Blog: Fairness in Forecasting and Learning Linear Dynamical Systems
- Blog: S-SOS: Stochastic Sum-Of-Squares for Parametric Polynomial Optimization
- Blog: Positivity and Optimization for Semi-Algebraic Functions
- Blog: Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
- Blog: Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
- Blog: An algorithm for semi-infinite polynomial optimization
- Blog: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Blog: GloptiPoly 3: moments, optimization and semidefinite programming
- Blog: The Moment-SOS hierarchy
- Blog: Exploiting structure of chance constrained programs via submodularity
- Blog: Special Issue: Polynomial and Tensor Optimization
- Blog: Convex and Network Flow Optimization for Structured Sparsity
- Blog: Learning of Linear Dynamical Systems as a Noncommutative Polynomial Optimization Problem
- Blog: On Sparse Canonical Correlation Analysis
- Blog: Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations
- Blog: Semialgebraic Optimization for Lipschitz Constants of ReLU Networks
- Blog: NLCertify: A Tool for Formal Nonlinear Optimization
- Blog: Minimizing the sum of many rational functions
- Blog: Exploiting term sparsity in noncommutative polynomial optimization
- Blog: CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization
- Blog: Estimating High-dimensional Non-Gaussian Multiple Index Models via Stein's Lemma
- Blog: Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
- Blog: The Moment-SOS hierarchy: Applications and related topics
- Blog: Peak Estimation for Uncertain and Switched Systems
- Blog: Detecting Dependencies in Sparse, Multivariate Databases Using Probabilistic Programming and Non-parametric Bayes
- Blog: A sublevel moment-SOS hierarchy for polynomial optimization
- Blog: Decomposed Structured Subsets for Semidefinite and Sum-of-Squares Optimization
- Blog: Non-convex P-Norm Projection for Robust Sparsity
- Blog: Certified Roundoff Error Bounds Using Semidefinite Programming
- Blog: Exploiting Sparsity in Complex Polynomial Optimization
- Blog: Convergence rates for sums-of-squares hierarchies with correlative sparsity
- Blog: A convex optimization approach to robust fundamental matrix estimation
- Blog: Lower bounds on the global minimum of a polynomial
- Blog: Regularizers for structured sparsity
- Blog: Certified Roundoff Error Bounds Using Semidefinite Programming
- Blog: On k-Column Sparse Packing Programs
- Blog: Fairness in Forecasting and Learning Linear Dynamical Systems
- Blog: A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_correlative_sparsity_exploitation_5e1cd328,
title = {correlative sparsity exploitation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/correlative-sparsity-exploitation/rdr_5e1cd3285be745239416a50c77fb5dc3},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_correlative_sparsity_exploitation_5e1cd328_v1,
title = {correlative sparsity exploitation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/correlative-sparsity-exploitation/rdr_5e1cd3285be745239416a50c77fb5dc3/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}