A scaling technique for finding the weighted analytic center of a polytope
From MaRDI portal
Publication:687084
DOI10.1007/BF01581079zbMath0784.90053MaRDI QIDQ687084
Pravin M. Vaidya, David S. Atkinson
Publication date: 21 March 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Related Items (10)
Sufficient weighted complementarity problems ⋮ A primal-dual interior-point method for linear programming based on a weighted barrier function ⋮ Primal-dual target-following algorithms for linear programming ⋮ A cutting plane algorithm for convex programming that uses analytic centers ⋮ A cutting plane method from analytic centers for stochastic programming ⋮ A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils ⋮ A path to the Arrow-Debreu competitive market equilibrium ⋮ Interior-point algorithms for a generalization of linear programming and weighted centring ⋮ Long-step interior-point algorithms for a class of variational inequalities with monotone operators ⋮ Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Scaling algorithms for network problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Geometric algorithms and combinatorial optimization
- A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This page was built for publication: A scaling technique for finding the weighted analytic center of a polytope
