Pages that link to "Item:Q4835390"
From MaRDI portal
The following pages link to A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming (Q4835390):
Displayed 11 items.
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- Linear programming with stochastic elements: An on-line approach (Q1368447) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
