Skip to main content
Article thumbnail
Location of Repository

A Globally Convergent Interior-Point Algorithm for Nonlinear Programming Problems

By I. Akrotirianakis and B. Rustem

Abstract

Abstract. This paper presents a primal-dual interior-point algorithm for solving general constrained nonlinear programming problems. The inequality constraints are incorporated into the objective function by means of a logarithmic barrier function. Also, satisfaction of the equality constraints is enforced through the use of an adaptive quadratic penalty function. The penalty parameter is determined using a strategy that ensures a descent property for a merit function. Global convergence of the algorithm is achieved through the monotonic decrease of a merit function. Finally, extensive computational results show that the algorithm can solve large and difficult problems in an efficient and robust way. Key Words. Primal-dual interior-point algorithms, merit functions, convergence theory. 1

Year: 1997
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.7000
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://pubs.doc.ic.ac.uk/inter... (external link)
  • Suggested articles


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