A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems

DOI10.1137/0803043zbMath0788.65071OpenAlexW2040424361MaRDI QIDQ4277515

Florian A. Potra, Yinyu Ye

Publication date: 30 May 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0803043

zbMATH Keywords

quadratic convergencepotential reduction algorithmentropy minimization problemsinterior optimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

A globally convergent primal-dual interior point algorithm for convex programming, Implementation of an inexact approach to solving linear semi-infinite programming problems, Modified primal path-following scheme for the monotone variational inequality problem, Interior-point methods for nonlinear complementarity problems, Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*, On the complexity of general matrix scaling and entropy minimization via the RAS algorithm, ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods, Improving complexity of structured convex optimization problems using self-concordant barriers, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems, An interior point parameterized central path following algorithm for linearly constrained convex programming, Interior-point algorithm for quadratically constrained entropy minimization problems