A Centered Projective Algorithm for Linear Programming

Related Items (64)

Analysis of some interior point continuous trajectories for convex programming ⋮ A globally convergent primal-dual interior point algorithm for convex programming ⋮ Global convergence in infeasible-interior-point algorithms ⋮ Interior-point algorithms for semi-infinite programming ⋮ Theoretical convergence of large-step primal-dual interior point algorithms for linear programming ⋮ Extensions of the potential reduction algorithm for linear programming ⋮ Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem ⋮ Interior-point solver for large-scale quadratic programming problems with bound constraints ⋮ Constant potential primal-dual algorithms: A framework ⋮ Asymptotic convergence in a generalized predictor-corrector method ⋮ Solving linear systems involved in constrained optimization ⋮ 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 ⋮ Potential-reduction methods in mathematical programming ⋮ Long-step strategies in interior-point primal-dual methods ⋮ On semimonotone star matrices and linear complementarity problem ⋮ New complexity results for the Iri-Imai method ⋮ Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems ⋮ Unnamed Item ⋮ A class of linear complementarity problems solvable in polynomial time ⋮ On some efficient interior point methods for nonlinear convex programming ⋮ 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 unified approach to interior point algorithms for linear complementarity problems: A summary ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ On lower bound updates in primal potential reduction methods for linear programming ⋮ A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start ⋮ A survey of search directions in interior point methods for linear programming ⋮ A note on a potential reduction algorithm for LP with simultaneous primal-dual updating ⋮ A convergent algorithm for quantile regression with smoothing splines ⋮ On affine scaling algorithms for nonconvex quadratic programming ⋮ On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm ⋮ Long steps in an \(O(n^ 3L)\) algorithm for linear programming ⋮ A polynomial method of approximate centers for linear programming ⋮ An active-set strategy in an interior point method for linear programming ⋮ Unnamed Item ⋮ On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm ⋮ A new polynomial time method for a linear complementarity problem ⋮ Convergence analysis of an inexact potential reduction method for convex quadratic programming ⋮ On the probabilistic complexity of finding an approximate solution for linear programming ⋮ On the behavior of the homogeneous self-dual model for conic convex optimization ⋮ Tensor complementarity problems. II: Solution methods ⋮ A new potential reduction algorithm for smooth convex programming ⋮ Computational experience with a modified potential reduction algorithm for linear programming ⋮ Near boundary behavior of primal-dual potential reduction algorithms for linear programming ⋮ On the convergence of primal-dual interior-point methods with wide neighborhoods ⋮ Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs ⋮ Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm ⋮ Polynomial affine algorithms for linear programming ⋮ An interior point potential reduction method for constrained equations ⋮ A potential reduction method for tensor complementarity problems ⋮ An interior point method, based on rank-1 updates, for linear programming ⋮ Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions ⋮ Degeneracy in interior point methods for linear programming: A survey ⋮ Interior-point algorithms for global optimization ⋮ O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming ⋮ On monotonicity in the scaled potential algorithm for linear programming ⋮ Algorithms for the solution of quadratic knapsack problems ⋮ An extension of the potential reduction algorithm for linear complementarity problems with some priority goals ⋮ Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming ⋮ An \(O(n^ 3L)\) potential reduction algorithm for linear programming ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming ⋮ Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited ⋮ A primal-dual affine-scaling potential-reduction algorithm for linear programming

This page was built for publication: A Centered Projective Algorithm for Linear Programming