Article thumbnail

An exact primal—dual penalty method approach to warmstarting interior-point methods for linear programming

By Hande Y. Benson, David and F. Shanno

Abstract

Abstract. One perceived deficiency of interior-point methods in comparison to active set methods is their inability to efficiently re-optimize by solving closely related problems after a warmstart. In this paper, we investigate the use of a primal-dual penalty approach to overcome this problem. We prove exactness and convergence and show encouraging numerical results on a set of linear and mixed integer programming problems. 1

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.170.2112
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.pages.drexel.edu/%7... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.