A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
From MaRDI portal
Recommendations
- Interior-point algorithm for quadratically constrained entropy minimization problems
- Optimization of “\log x” Entropy over Linear Equality Constraints
- A new potential reduction algorithm for smooth convex programming
- scientific article; zbMATH DE number 2147603
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
Cited in
(14)- Interior-point methods for nonlinear complementarity problems
- Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- scientific article; zbMATH DE number 6664189 (Why is no real title available?)
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
- A globally convergent primal-dual interior point algorithm for convex programming
- Interior-point algorithm for quadratically constrained entropy minimization problems
- Improving complexity of structured convex optimization problems using self-concordant barriers
- Newton polytopes and relative entropy optimization
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- Modified primal path-following scheme for the monotone variational inequality problem
This page was built for publication: A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277515)
