Relative entropy optimization and its applications

DOI10.1007/S10107-016-0998-2zbMATH Open1357.81037OpenAlexW2321429733MaRDI QIDQ507310FDOQ507310

Authors: 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

Recommendations

• On convex optimization problems in quantum information theory
• Relative entropy relaxations for signomial optimization
• Entropy optimization models with convex constraints
• The maximum entropy principle as a convex programming problem and related inequalities
• Efficient optimization of the quantum relative entropy

zbMATH Keywords

dynamical systemsShannon entropyquantum informationrobust optimizationmatrix permanentAraki-Umegaki relative entropyGolden-Thompson inequalityoptimization over non-commuting variablesquantum channel capacityvon-Neumann entropy

Mathematics Subject Classification ID

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

Cites Work

• Elements of Information Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Convex Analysis
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Convex trace functions and the Wigner-Yanase-Dyson conjecture
• Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
• Title not available (Why is that?)
• Robust optimization
• Information Theory and Statistical Mechanics
• Robust Solutions to Least-Squares Problems with Uncertain Data
• The capacity of the quantum channel with general signal states
• Hybrid Systems: Computation and Control
• The complexity of computing the permanent
• Applications of second-order cone programming
• Semidefinite Optimization and Convex Algebraic Geometry
• On Polyhedral Approximations of the Second-Order Cone
• Robust convex optimization
• Lifts of Convex Sets and Cone Factorizations
• A tutorial on geometric programming
• Geometric Programming Duals of Channel Capacity and Rate Distortion
• Permanents
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
• Geometric Programming for Communication Systems
• A note on maximizing the permanent of a positive definite hermitian matrix, given the eigenvalues^∗
• The maximum permanent of a 3-by-3 positive semidefinite matrix, given the eigenvalues
• Mixed volumes of polytopes
• Title not available (Why is that?)
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Proof of the van der Waerden conjecture for permanents
• Relative entropy relaxations for signomial optimization
• Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
• Low-rank kernel learning with Bregman matrix divergences
• Determinant Maximization with Linear Matrix Inequality Constraints
• Digital Circuit Optimization via Geometric Programming
• Title not available (Why is that?)
• Operations and measurements. II
• 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
• An extended conic formulation for geometric optimization
• OR Practice—Solving Complex Chemical Equilibria Using a Geometric-Programming Based Technique
• Title not available (Why is that?)
• Tractable approximate robust geometric programming

Cited In (34)

• A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
• Lifting for simplicity: concise descriptions of convex sets
• A Positivstellensatz for sums of nonnegative circuit polynomials
• Relative entropy relaxations for signomial optimization
• On variational expressions for quantum relative entropies
• A guide to conic optimisation and its applications
• Error bounds, facial residual functions and applications to the exponential cone
• Title not available (Why is that?)
• Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
• Symmetry reduction in AM/GM-based optimization
• Primal-dual interior-point methods for domain-driven formulations
• Projection onto the exponential cone: a univariate root-finding problem
• Quantum entropic regularization of matrix-valued optimal transport
• Optimal Self-Concordant Barriers for Quantum Relative Entropies
• Algebraic Perspectives on Signomial Optimization
• Performance enhancements for a generic conic interior point algorithm
• A note on entropy optimization
• The dual cone of sums of non-negative circuit polynomials
• Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
• Strong convexity of sandwiched entropies and related optimization problems
• Title not available (Why is that?)
• Quantum theory in finite dimension cannot explain every general process with finite memory
• Newton polytopes and relative entropy optimization
• Efficient optimization of the quantum relative entropy
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
• Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
• Hessian barrier algorithms for non-convex conic optimization
• Title not available (Why is that?)
• Graphical model selection for a particular class of continuous-time processes.
• Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
• A unified framework of SAGE and SONC polynomials and its duality theory
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials

This page was built for publication: Relative entropy optimization and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507310)