Image de couverture de livre

A hierarchy of convex relaxations for the total variation distance

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Lasserre, Jean-Bernard
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
par: Mai, Ngoc Hoang Anh, et autres
Publié: (2022)

Finite convergence of the Moment-SOS hierarchy under hidden convexity
par: Ðurašinović, Srećko, et autres
Publié: (2026)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
par: Lasserre, Jean B
Publié: (2025)

Gaussian mixtures closest to a given measure via optimal transport
par: Lasserre, Jean-Bernard
Publié: (2024)

An infinite-dimensional Christoffel function and detection of abnormal trajectories
par: Henrion, Didier, et autres
Publié: (2024)

A Generalized Pell's equation for a class of multivariate orthogonal polynomials
par: Lasserre, Jean-Bernard, et autres
Publié: (2023)

A Christoffel-like function for high-dimensional support inference in graphical models
par: Lasserre, Jean-Bernard, et autres
Publié: (2024)

Approximate D-optimal design and equilibrium measure
par: Henrion, Didier, et autres
Publié: (2024)

A laplace duality for integration
par: Lasserre, Jean B
Publié: (2025)

An extension of the mean value theorem
par: Lasserre, Jean B
Publié: (2025)

Connecting Max-entropy With Computational Geometry, LP And SDP
par: Lasserre, Jean B
Publié: (2026)

Uncertainty Quantification of Set-Membership Estimation in Control and Perception: Revisiting the Minimum Enclosing Ellipsoid
par: Tang, Yukai, et autres
Publié: (2023)

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach
par: Đurašinović, Srećko, et autres
Publié: (2025)

Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
par: Wang, Jie, et autres
Publié: (2020)

Moment LMI approach to LTV impulsive control
par: Claeys, Mathieu, et autres
Publié: (2013)

Polynomial argmin for recovery and approximation of multivariate discontinuous functions
par: Henrion, Didier, et autres
Publié: (2023)

Shannon-and von neumann-entropy regularizations of linear and semidefinite programs
par: Chhatoi, Saroj Prasad, et autres
Publié: (2025)

Leveraging Christoffel-Darboux Kernels to Strengthen Moment-SOS Relaxations
par: Ðurašinović, Srećko, et autres
Publié: (2025)

Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
par: Chhatoi, Saroj Prasad, et autres
Publié: (2025)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
par: Kılınç-Karzan, Fatma, et autres
Publié: (2024)

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization
par: Yang, Jianting, et autres
Publié: (2024)

An over-relaxed ADMM for separable convex programming and its applications to statistical learning
par: Ni, Renyuan
Publié: (2024)

First-order SDSOS-convex semi-algebraic optimization and exact SOCP relaxations
par: Yang, Chengmiao, et autres
Publié: (2025)

Semidefinite relaxations for nonlinear elasticity with energies convex in the Cauchy-Green strain tensor
par: Henrion, Didier, et autres
Publié: (2026)

Numerical analysis of the convex relaxation of the barrier parameter functional of self-concordant barriers
par: Pirau, Vitali, et autres
Publié: (2025)

An adaptive linearized alternating direction multiplier method with a relaxation step for convex programming
par: Wang, Boran
Publié: (2024)

On moment relaxations for linear state feedback controller synthesis with non-convex quadratic costs and constraints
par: Gramlich, Dennis, et autres
Publié: (2024)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
par: Carrasco, Pablo, et autres
Publié: (2024)

Computing AD-compatible subgradients of convex relaxations of implicit functions
par: Song, Yingkai, et autres
Publié: (2025)

The polarization hierarchy for polynomial optimization over convex bodies, with applications to nonnegative matrix rank
par: Plávala, Martin, et autres
Publié: (2024)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
par: Tawarmalani, Mohit
Publié: (2024)

A convex variational principle for the necessary conditions of classical optimal control
par: Acharya, Amit, et autres
Publié: (2025)

Towards sparse optimization over convex loops: Equivalence of Square Root Velocity distance and Wasserstein-Fisher-Rao
par: Cristinelli, Giacomo, et autres
Publié: (2026)

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
par: Hermant, Julien, et autres
Publié: (2024)

Convergence rates for the moment-SoS hierarchy
par: Schlosser, Corbinian, et autres
Publié: (2024)

A new use of the Kurdyka-Lojasiewicz property to study asymptotic behaviours of some stochastic optimization algorithms in a non-convex differentiable framework
par: Fest, Jean-Baptiste
Publié: (2023)

SPLD polynomial optimization and bounded degree SOS hierarchies
par: Jiao, Liguo, et autres
Publié: (2025)

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
par: Dolgopolik, M. V.
Publié: (2023)

Optimal $L^p$-approximation of convex sets by convex subsets
par: Fattah, Zakaria, et autres
Publié: (2025)

A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
par: Wang, Jie, et autres
Publié: (2023)