Relative entropy optimization and its applications

DOI10.1007/s10107-016-0998-2zbMath1357.81037OpenAlexW2321429733MaRDI QIDQ507310

Parikshit Shah, Venkat Chandrasekaran

Publication date: 3 February 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-0998-2

zbMATH Keywords

dynamical systemsrobust optimizationShannon entropyquantum informationGolden-Thompson inequalityvon-Neumann entropymatrix permanentAraki-Umegaki relative entropyoptimization over non-commuting variablesquantum channel capacity

Mathematics Subject Classification ID

Convex programming (90C25) Measures of information, entropy (94A17) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40) Optimality conditions for problems in abstract spaces (49K27) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items

Algebraic Perspectives on Signomial Optimization, Lifting for Simplicity: Concise Descriptions of Convex Sets, Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, Symmetry Reduction in AM/GM-Based Optimization, Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions, On variational expressions for quantum relative entropies, Error bounds, facial residual functions and applications to the exponential cone, Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems, Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions, Optimal Self-Concordant Barriers for Quantum Relative Entropies, Performance enhancements for a generic conic interior point algorithm, Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Projection onto the exponential cone: a univariate root-finding problem, Unnamed Item, Quantum theory in finite dimension cannot explain every general process with finite memory, A Positivstellensatz for Sums of Nonnegative Circuit Polynomials, A guide to conic optimisation and its applications, Efficient optimization of the quantum relative entropy, Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, The dual cone of sums of non-negative circuit polynomials, Graphical model selection for a particular class of continuous-time processes, Quantum entropic regularization of matrix-valued optimal transport, A unified framework of SAGE and SONC polynomials and its duality theory, A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Tractable approximate robust geometric programming
• Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
• A tutorial on geometric programming
• Applications of second-order cone programming
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Proof of the van der Waerden conjecture for permanents
• Mixed volumes of polytopes
• Trace optimization problems and generalized geometric programming
• The design of FIR filters in the complex plane by convex optimization
• Computing mixed discriminants, mixed volumes, and permanents
• Capacities of quantum channels and how to find them
• A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
• Operations and measurements. II
• Convex trace functions and the Wigner-Yanase-Dyson conjecture
• Lectures on Modern Convex Optimization
• Robust Convex Optimization
• Relative Entropy Relaxations for Signomial Optimization
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Information Theory and Statistical Mechanics
• Geometric Programming Duals of Channel Capacity and Rate Distortion
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• A note on maximizing the permanent of a positive definite hermitian matrix, given the eigenvalues^∗
• OR Practice—Solving Complex Chemical Equilibria Using a Geometric-Programming Based Technique
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Determinant Maximization with Linear Matrix Inequality Constraints
• The capacity of the quantum channel with general signal states
• The maximum permanent of a 3-by-3 positive semidefinite matrix, given the eigenvalues
• Semidefinite Optimization and Convex Algebraic Geometry
• Lifts of Convex Sets and Cone Factorizations
• Hybrid Systems: Computation and Control
• Digital Circuit Optimization via Geometric Programming
• Elements of Information Theory
• Permanents
• Convex Analysis
• On Polyhedral Approximations of the Second-Order Cone
• Geometric Programming for Communication Systems
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents