Long-step path-following algorithm for quantum information theory: some numerical aspects and applications

DOI10.3934/naco.2021017zbMath1487.90517arXiv1906.00037OpenAlexW3160417834MaRDI QIDQ2673269

Cunlu Zhou, Leonid Faybusovich

Publication date: 9 June 2022

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.00037

zbMATH Keywords

quantum information theoryquantum key distributionquantum relative entropyself-concordant functionsmatrix monotone functionslong-step path-following algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Interior-point methods (90C51) Computational methods for problems pertaining to quantum theory (81-08)

Related Items

Linear optimization over homogeneous matrix cones

Uses Software

• SDPT3
• Mosek

Cites Work

• Unnamed Item
• Lectures on convex optimization
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
• Semidefinite approximations of the matrix logarithm
• Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Efficient optimization of the quantum relative entropy