Interior-point algorithms for a generalization of linear programming and weighted centring

@article{Anstreicher2012InteriorpointAF,
  title={Interior-point algorithms for a generalization of linear programming and weighted centring},
  author={Kurt M. Anstreicher},
  journal={Optimization Methods and Software},
  year={2012},
  volume={27},
  pages={605-612}
}
We consider an extension of ordinary linear programming (LP) that adds weighted logarithmic barrier terms for some variables. The resulting problem generalizes both LP and the problem of finding the weighted analytic center of a polytope. We show that the problem has a dual of the same form and give complexity results for several different interior-point algorithms. We obtain an improved complexity result for certain cases by utilyzing a combination of the volumetric and logarithmic barriers… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Weighted Complementarity Problems - A New Paradigm for Computing Equilibria

SIAM Journal on Optimization • 2012
View 4 Excerpts
Highly Influenced

Sufficient weighted complementarity problems

Comp. Opt. and Appl. • 2016
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 14 references

A new algorithm for minimizing convex functions over convex sets

Math. Program. • 1996
View 5 Excerpts
Highly Influenced

A technique for bounding the number of iterations in path following algorithms

P. M. Vaidya, D. S. Atkinson
Complexity in Numerical Optimization, P.M. Pardalos, ed., World Scientific, Singapore • 1993
View 5 Excerpts
Highly Influenced

A path to the Arrow-Debreu competitive market equilibrium

Math. Program. • 2008
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…