Potential-reduction methods in mathematical programming
From MaRDI portal
Publication:1361104
DOI10.1007/BF02614377zbMath0881.90097OpenAlexW2082909387MaRDI QIDQ1361104
Publication date: 23 July 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614377
Related Items (6)
A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ Stopping criteria for inner iterations in inexact potential reduction methods: a computational study ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ Convergence analysis of an inexact potential reduction method for convex quadratic programming ⋮ Tensor complementarity problems. II: Solution methods ⋮ Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A polynomial Newton method for linear programming
- On the convexity of the multiplicative version of Karmarkar's potential function
- A combined phase I-phase II projective algorithm for linear programming
- Karmarkar's linear programming algorithm and Newton's method
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- A combined phase I-phase II scaled potential algorithm for linear programming
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- An interior point potential reduction algorithm for the linear complementarity problem
- On interior algorithms for linear programming with no regularity assumptions
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- On the number of iterations of Karmarkar's algorithm for linear programming
- Constant potential primal-dual algorithms: A framework
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- Polynomial affine algorithms for linear programming
- Superlinear primal-dual affine scaling algorithms for LCP
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- Path-Following Methods for Linear Programming
- On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
- A Potential Reduction Algorithm Allowing Column Generation
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Semidefinite Programming
This page was built for publication: Potential-reduction methods in mathematical programming
