Potential-reduction methods in mathematical programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1047677
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- scientific article; zbMATH DE number 4197744
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- An infeasible-interior-point potential-reduction algorithm for linear programming
Cites work
- A Centered Projective Algorithm for Linear Programming
- A combined phase I-phase II projective algorithm for linear programming
- A combined phase I-phase II scaled potential algorithm for linear programming
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A Potential Reduction Algorithm Allowing Column Generation
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- An interior point potential reduction algorithm for the linear complementarity problem
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- Constant potential primal-dual algorithms: A framework
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Karmarkar's linear programming algorithm and Newton's method
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- 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
- On the convexity of the multiplicative version of Karmarkar's potential function
- On the number of iterations of Karmarkar's algorithm for linear programming
- On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
- Path-Following Methods for Linear Programming
- Polynomial affine algorithms for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Semidefinite Programming
- Superlinear primal-dual affine scaling algorithms for LCP
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
Cited in
(19)- A nonconvex weighted potential function for polynomial target following methods
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Extensions of the potential reduction algorithm for linear programming
- Large step volumetric potential reduction algorithms for linear programming
- An infeasible-interior-point potential-reduction algorithm for linear programming
- Tensor complementarity problems. II: Solution methods
- 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
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- scientific article; zbMATH DE number 1047677 (Why is no real title available?)
- Computational experience with a modified potential reduction algorithm for linear programming
- scientific article; zbMATH DE number 4197744 (Why is no real title available?)
- A combination of potential reduction steps and steepest descent steps for solving convex programming problems
- New interior-point algorithm for linear optimization based on a universal tangent direction
- An active-set strategy in an interior point method for linear programming
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- Starting-point strategies for an infeasible potential reduction method
This page was built for publication: Potential-reduction methods in mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361104)
