An Implementation of a Primal-Dual Interior Point Method for Linear Programming
From MaRDI portal
Publication:4019974
DOI10.1287/ijoc.1.2.70zbMath0752.90047MaRDI QIDQ4019974
David F. Shanno, Clyde l. Monma, Kevin A. McShane
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1.2.70
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
The theory of linear programming:skew symmetric self-dual problems and the central path*, Unnamed Item, Unnamed Item, An easy way to teach interior-point methods., A little theorem of the big \({\mathcal M}\) in interior point algorithms, On the finite convergence of interior-point algorithms for linear programming, Convergence behavior of interior-point algorithms, Vector processing in simplex and interior methods for linear programming, A unified view of interior point methods for linear programming, Feasibility issues in a primal-dual interior-point method for linear programming, Splitting dense columns in sparse linear systems, Computational experience with a primal-dual interior point method for linear programming, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, An algorithm for linear programming that is easy to implement, On finding a vertex solution using interior point methods, Global convergence of the affine scaling methods for degenerate linear programming problems, Comparative analysis of affine scaling algorithms based on simplifying assumptions, Modified barrier functions (theory and methods), A brief description of ALPO, On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise, On combined phase 1-phase 2 projective methods for linear programming, An interior point method for quadratic programs based on conjugate projected gradients, Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm, A primal-dual infeasible-interior-point algorithm for linear programming, An extension of the potential reduction algorithm for linear complementarity problems with some priority goals, A multiobjective interior primal-dual linear programming algorithm, Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited, Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems, Solving symmetric indefinite systems in an interior-point method for linear programming, A primal-dual affine-scaling potential-reduction algorithm for linear programming, Interior dual proximal point algorithm for linear programs, Global convergence in infeasible-interior-point algorithms, Superlinear convergence of infeasible-interior-point methods for linear programming, Primal-dual algorithms for linear programming based on the logarithmic barrier method, Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization, Linear programming with stochastic elements: An on-line approach, An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points, Advances in design and implementation of optimization software, Product-form Cholesky factorization in interior point methods for second-order cone programming, Near boundary behavior of primal-dual potential reduction algorithms for linear programming, A primal-dual interior-point method for linear programming based on a weighted barrier function, A predictor-corrector method for extended linear-quadratic programming, Primal-dual methods for linear programming, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, Combining phase I and phase II in a potential reduction algorithm for linear programming, Interior-point methods for linear programming: a review
