Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions

DOI10.1016/J.LAA.2017.09.017zbMath1419.90084OpenAlexW2759575088WikidataQ114851452 ScholiaQ114851452MaRDI QIDQ2412702

Leonid Faybusovich

Publication date: 27 October 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.09.017

zbMATH Keywords

quantum entropyconvex objective functionsoptimization over symmetric cones

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Finite-dimensional structures of Jordan algebras (17C55)

Related Items (2)

Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions ⋮ Primal-Dual Interior-Point Methods for Domain-Driven Formulations

Cites Work

• Unnamed Item
• Unnamed Item
• Relative entropy optimization and its applications
• On some efficient interior point methods for nonlinear convex programming
• Euclidean Jordan algebras and interior-point algorithms
• Jordan-algebraic aspects of nonconvex optimization over symmetric cones
• A path following algorithm for a class of convex programming problems
• A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• A Jordan-algebraic approach to potential-reduction algorithms

This page was built for publication: Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions