Pages that link to "Item:Q4277515"

The following pages link to A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems (Q4277515):

Displaying 14 items.

• Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
• A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
• Modified primal path-following scheme for the monotone variational inequality problem (Q1372549) (← links)
• ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
• Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
• Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
• Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions (Q2412702) (← links)
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^* (Q2709447) (← links)
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (Q4240625) (← links)
• (Q5298557) (← links)