Imagen de Portada

Connecting Max-entropy With Computational Geometry, LP And SDP

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Lasserre, Jean B
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Shannon-and von neumann-entropy regularizations of linear and semidefinite programs
por: Chhatoi, Saroj Prasad, et al.
Publicado: (2025)

An extension of the mean value theorem
por: Lasserre, Jean B
Publicado: (2025)

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

A laplace duality for integration
por: Lasserre, Jean B
Publicado: (2025)

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

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

Fast entropy-regularized SDP relaxations for permutation synchronization
por: Lindsey, Michael, et al.
Publicado: (2025)

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

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

Computational Guarantees for Restarted PDHG for LP based on "Limiting Error Ratios" and LP Sharpness
por: Xiong, Zikai, et al.
Publicado: (2023)

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

Tight SDP relaxations for cardinality-constrained problems
por: Wiegele, Angelika, et al.
Publicado: (2021)

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

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

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

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
por: Zhou, Jinling, et al.
Publicado: (2025)

LP Relaxations for Routing and Wavelength Assignment with Partial Path Protection: Formulations and Computations
por: Yang, Xianyan, et al.
Publicado: (2025)

Moment LMI approach to LTV impulsive control
por: Claeys, Mathieu, et al.
Publicado: (2013)

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
por: Hartmann, Luca M., et al.
Publicado: (2024)

Polynomial argmin for recovery and approximation of multivariate discontinuous functions
por: Henrion, Didier, et al.
Publicado: (2023)

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach
por: Đurašinović, Srećko, et al.
Publicado: (2025)

Tightness of SDP and Burer-Monteiro Factorization for Phase Synchronization in High-Noise Regime
por: Zhang, Anderson Ye
Publicado: (2025)

Approximating Dispatchable Regions in Three-Phase Radial Networks with Conditions for Exact SDP Relaxation
por: Fang, Bohang, et al.
Publicado: (2025)

SDP bounds on quantum codes
por: Munné, Gerard Anglès, et al.
Publicado: (2024)

A Scalable Bundle Method for Exact Reformulation of SDP in Three-Phase Power Flow Feasibility
por: Fang, Bohang, et al.
Publicado: (2026)

A more efficient reformulation of complex SDP as real SDP
por: Wang, Jie
Publicado: (2023)

TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
por: Mahajan, Ishaan, et al.
Publicado: (2026)

An SDP Relaxation for the Sparse Integer Least Squares Problem
por: Del Pia, Alberto, et al.
Publicado: (2022)

Provable Exactness for Asymmetric Low-Rank SDP Learning
por: Hu, Enliang
Publicado: (2018)

Chordal Sparsity for SDP-based Neural Network Verification
por: Xue, Anton, et al.
Publicado: (2022)

Transit-MP: Transit-Prioritized Max-Pressure Control in Sparse Connected Vehicle Environments
por: Tan, Chaopeng, et al.
Publicado: (2025)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
por: Hou, Di, et al.
Publicado: (2025)

Presolving for GPU-Accelerated First-Order LP Solvers
por: Cederberg, Daniel, et al.
Publicado: (2026)

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

Robust Paths: Geometry and Computation
por: Hao, Hao, et al.
Publicado: (2025)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
por: Del Pia, Alberto, et al.
Publicado: (2025)

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
por: Dizon, Neil D., et al.
Publicado: (2026)

On the Exactness of SDP Relaxation for Quadratic Assignment Problem
por: Ling, Shuyang
Publicado: (2024)

A New Crossover Algorithm for LP Inspired by the Spiral Dynamic of PDHG
por: Liu, Tianhao, et al.
Publicado: (2024)