A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

Nash, Stephen G.; Polyak, R.; Sofer, Ariela

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

Document ID

19980006844

Acquisition Source

Legacy CDMS

Document Type

Reprint (Version printed in journal)

Authors

Date Acquired

September 6, 2013

Publication Date

January 1, 1994

Publication Information

Publication: Large Scale Optimization: State of the Art

Publisher: Kluwer Academic Publishers

Subject Category

Report/Patent Number

Funding Number(s)

Distribution Limits

Public

Public Use Permitted.

Available Downloads

Name

Type

19980006844.pdf

STI

No Preview Available

NTRS

NTRS - NASA Technical Reports Server

Available Downloads

Related Records