# Constant potential primal—dual algorithms: A framework

@article{Tunel1994ConstantPP, title={Constant potential primal—dual algorithms: A framework}, author={Levent Tunçel}, journal={Mathematical Programming}, year={1994}, volume={66}, pages={145-159} }

- Published in Math. Program. 1994
DOI:10.1007/BF01581142

We start with a study of the primal—dual affine-scaling algorithms for linear programs. Using ideas from Kojima et al., Mizuno and Nagasawa, and new potential functions we establish a framework for primal—dual algorithms that keep a potential function value fixed. We show that if the potential function used in the algorithm is compatible with a corresponding neighborhood of the central path then the convergence proofs simplify greatly. Our algorithms have the property that all the iterates can… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 10 CITATIONS

## Superlinear primal-dual affine scaling algorithms for LCP

VIEW 8 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems

VIEW 2 EXCERPTS

CITES METHODS

## An O ( √ nL ) Iteration Bound Primal-Dual Cone Affine Scaling Algorithm for Linear Programming

VIEW 1 EXCERPT

CITES BACKGROUND

## An Improved Interior-point Approach for Use in Reservoir Operation

VIEW 2 EXCERPTS

CITES BACKGROUND

## On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs

VIEW 2 EXCERPTS

CITES BACKGROUND & METHODS

## Potential Reduction Algorithms

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 13 REFERENCES

## Pathways to the optimal set in linear programming

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL