Relative entropy optimization and its applications
From MaRDI portal
(Redirected from Publication:507310)
dynamical systemsShannon entropyquantum informationrobust optimizationmatrix permanentAraki-Umegaki relative entropyGolden-Thompson inequalityoptimization over non-commuting variablesquantum channel capacityvon-Neumann entropy
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)
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
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3144846 (Why is no real title available?)
- scientific article; zbMATH DE number 4100422 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3203564 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- A note on maximizing the permanent of a positive definite hermitian matrix, given the eigenvalues∗
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A tutorial on geometric programming
- An extended conic formulation for geometric optimization
- Applications of second-order cone programming
- Capacities of quantum channels and how to find them
- Computing mixed discriminants, mixed volumes, and permanents
- Convex Analysis
- Convex trace functions and the Wigner-Yanase-Dyson conjecture
- Determinant Maximization with Linear Matrix Inequality Constraints
- Digital Circuit Optimization via Geometric Programming
- Elements of Information Theory
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- Geometric Programming for Communication Systems
- Hybrid Systems: Computation and Control
- Information Theory and Statistical Mechanics
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lifts of Convex Sets and Cone Factorizations
- Low-rank kernel learning with Bregman matrix divergences
- Mixed volumes of polytopes
- OR Practice—Solving Complex Chemical Equilibria Using a Geometric-Programming Based Technique
- On Polyhedral Approximations of the Second-Order Cone
- Operations and measurements. II
- Permanents
- Proof of the van der Waerden conjecture for permanents
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Relative entropy relaxations for signomial optimization
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust convex optimization
- Robust optimization
- Semidefinite Optimization and Convex Algebraic Geometry
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- The capacity of the quantum channel with general signal states
- The complexity of computing the permanent
- The design of FIR filters in the complex plane by convex optimization
- The maximum permanent of a 3-by-3 positive semidefinite matrix, given the eigenvalues
- Trace optimization problems and generalized geometric programming
- Tractable approximate robust geometric programming
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
Cited in
(34)- Lifting for simplicity: concise descriptions of convex sets
- A Positivstellensatz for sums of nonnegative circuit polynomials
- Primal-dual interior-point methods for domain-driven formulations
- A note on entropy optimization
- Graphical model selection for a particular class of continuous-time processes.
- On variational expressions for quantum relative entropies
- Error bounds, facial residual functions and applications to the exponential cone
- The dual cone of sums of non-negative circuit polynomials
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- A guide to conic optimisation and its applications
- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
- Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
- Quantum theory in finite dimension cannot explain every general process with finite memory
- Relative entropy relaxations for signomial optimization
- scientific article; zbMATH DE number 7378399 (Why is no real title available?)
- Projection onto the exponential cone: a univariate root-finding problem
- Efficient optimization of the quantum relative entropy
- Hessian barrier algorithms for non-convex conic optimization
- Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
- Quantum entropic regularization of matrix-valued optimal transport
- A unified framework of SAGE and SONC polynomials and its duality theory
- Optimal Self-Concordant Barriers for Quantum Relative Entropies
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- scientific article; zbMATH DE number 854294 (Why is no real title available?)
- Algebraic Perspectives on Signomial Optimization
- scientific article; zbMATH DE number 6276166 (Why is no real title available?)
- Strong convexity of sandwiched entropies and related optimization problems
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
- Newton polytopes and relative entropy optimization
- Performance enhancements for a generic conic interior point algorithm
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Symmetry reduction in AM/GM-based optimization
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)
