Cover Image

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Đurašinović, Srećko, Lasserre, Jean-Bernard, Magron, Victor
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization
by: Yang, Jianting, et al.
Published: (2024)

Finite convergence of the Moment-SOS hierarchy under hidden convexity
by: Ðurašinović, Srećko, et al.
Published: (2026)

Leveraging Christoffel-Darboux Kernels to Strengthen Moment-SOS Relaxations
by: Ðurašinović, Srećko, et al.
Published: (2025)

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
by: Mai, Ngoc Hoang Anh, et al.
Published: (2022)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
by: Sudoso, Antonio M.
Published: (2024)

Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching
by: Angell, Rico, et al.
Published: (2023)

Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
by: Wang, Jie, et al.
Published: (2020)

A hierarchy of convex relaxations for the total variation distance
by: Lasserre, Jean-Bernard
Published: (2024)

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming
by: Zhuang, Yubo, et al.
Published: (2023)

Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification
by: Ebihara, Yoshio, et al.
Published: (2023)

Semidefinite Relaxations of the Gromov-Wasserstein Distance
by: Chen, Junyu, et al.
Published: (2023)

Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization
by: Cory-Wright, Ryan, et al.
Published: (2025)

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
by: Garber, Dan, et al.
Published: (2024)

Gaussian mixtures closest to a given measure via optimal transport
by: Lasserre, Jean-Bernard
Published: (2024)

A Mathematical Programming Approach to Optimal Classification Forests
by: Blanco, Víctor, et al.
Published: (2022)

Dual Conic Proxy for Semidefinite Relaxation of AC Optimal Power Flow
by: Qiu, Guancheng, et al.
Published: (2025)

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
by: Anderson, Brendon G., et al.
Published: (2021)

A Generalized Pell's equation for a class of multivariate orthogonal polynomials
by: Lasserre, Jean-Bernard, et al.
Published: (2023)

An infinite-dimensional Christoffel function and detection of abnormal trajectories
by: Henrion, Didier, et al.
Published: (2024)

Convergence rates for polynomial optimization on set products
by: Magron, Victor
Published: (2025)

Imitation Learning from Observations: An Autoregressive Mixture of Experts Approach
by: Wang, Renzi, et al.
Published: (2024)

A conditional gradient homotopy method with applications to Semidefinite Programming
by: Dvurechensky, Pavel, et al.
Published: (2022)

A Christoffel-like function for high-dimensional support inference in graphical models
by: Lasserre, Jean-Bernard, et al.
Published: (2024)

Approximate D-optimal design and equilibrium measure
by: Henrion, Didier, et al.
Published: (2024)

A Penalty Approach for Differentiation Through Black-Box Quadratic Programming Solvers
by: Linghu, Yuxuan, et al.
Published: (2026)

A laplace duality for integration
by: Lasserre, Jean B
Published: (2025)

Mean-Field Langevin Dynamics for Signed Measures via a Bilevel Approach
by: Wang, Guillaume, et al.
Published: (2024)

A Low-Rank ADMM Splitting Approach for Semidefinite Programming
by: Han, Qiushi, et al.
Published: (2024)

A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
by: Wang, Jie, et al.
Published: (2023)

A Novel Approach in Solving Stochastic Generalized Linear Regression via Nonconvex Programming
by: Anh, Vu Duc, et al.
Published: (2024)

On the Complexity of p-Order Cone Programs
by: Blanco, Víctor, et al.
Published: (2025)

CaVE: A Cone-Aligned Approach for Fast Predict-then-optimize with Binary Linear Programs
by: Tang, Bo, et al.
Published: (2023)

A Unified Approach to Extract Interpretable Rules from Tree Ensembles via Integer Programming
by: Bonasera, Lorenzo, et al.
Published: (2024)

$ϕ$-Balancing for Mixture-of-Experts Training
by: Chen, Lizhang, et al.
Published: (2026)

A Mathematical Optimization Approach to Multisphere Support Vector Data Description
by: Blanco, Víctor, et al.
Published: (2025)

An extension of the mean value theorem
by: Lasserre, Jean B
Published: (2025)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
by: Lasserre, Jean B
Published: (2025)

Connecting Max-entropy With Computational Geometry, LP And SDP
by: Lasserre, Jean B
Published: (2026)

A Relaxed Wasserstein Distance Formulation for Mixtures of Radially Contoured Distributions
by: Chen, Keyu, et al.
Published: (2025)

Uncertainty Quantification of Set-Membership Estimation in Control and Perception: Revisiting the Minimum Enclosing Ellipsoid
by: Tang, Yukai, et al.
Published: (2023)