Abstract
The paper considers Polyak’s modified logarithmic barrier function for nonlinear programming. Comparisons are made to the classic logarithmic barrier function, and the advantages of the modified log-barrier method, including starting from nonfeasible starting points, inclusion of equality constraints, and better conditioning are discussed. Extensive computational results are included which demonstrate that the method is clearly superior to the classic method and holds definite promise as a viable method for large-scale nonlinear programming.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. M. L. Beale, A derivation of conjugate gradients, in Numerical Methods for Nonlinear Optimization, F. A. Lootsma, ed., Academic Press, London, England, 1972, pp. 39–43.
A. R. Conn, N. I. M. Gould, AND P. L. Toint, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, Technical Report 92/07, Department of Mathematics, Faculté Universitaires de Namur, Namur, Belgium, 1992.
R. S. Dembo, A set of geometric programming test problems and their solutions, Mathematical Programming, 10 (1976), pp. 192–213.
A. V. Fiacco AND G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley & Sons, New York, 1968. Reprint: Volume 4 of SIAM Classics in Applied Mathematics, SIAM Publications, Philadelphia, PA 19104–2688, USA, 1990.
R. Fletcher, Practical Methods of Optimization, John Wiley & Sons, New York, second ed., 1987.
K. R. Frisch, The logarithmic potential method for convex programming, unpublished manuscript, Institute of Economics, University of Oslo, Oslo, Norway, May 1955.
P. E. Gill, W. Murray, AND M. H. Wright, Practical Optimization, Academic Press, 1981.
W. Hock AND K. Schittkowski, Test Examples for Nonlinear Programming Codes, vol. 187 of Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, 1981.
K. Jittorntrum AND M. Osborne, A modified barrier function method with improved rate of convergence for degenerate problems, Journal of the Australian Mathematical Society (Series B), 21 (1980), pp. 305–329.
L. S. Lasdon, J. C. Plummer, AND G. Yu, Primal-dual and primal interior point algorithms for general nonlinear programs, tech. report, Dept. of Management Science and Information Systems, College of Business Administration, University of Texas at Austin, Austin, TX 78712, USA, 1993.
I. J. Lustig, R. E. MARSTEN, AND D. F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra and Its Applications, 152 (1991), pp. 191–222.
G. P. McCormick, The projective SUMT method for convex optimization, Mathematics of Operations Research, 14 (1989), pp. 203–224.
W. Murray, Analytical expressions for eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, Journal of Optimization Theory and Applications, 7 (1971), pp. 181–196.
W. Murray AND M. H. Wright, Line search procedures for the logarithmic barrier function, Numerical Analysis Manuscript 92-01, AT & T Bell Laboratories, Murray Hill, NJ 07974, USA, 1991. Based on the Technical Report SOL 76- 18, Dept. of Operations Research, Stanford University, Stanford, CA 94305, USA, 1976.
S. G. Nash AND J. Nocedal, A numerical study of the limited-memory BFGS method and the truncated-Newton method for large-scale optimization, SIAM Journal on Optimization, 1 (1991), pp. 358–372.
S. G. Nash AND A. Sofer, A barrier method for large-scale constrained optimization, ORSA Journal on Computing, 5 (1993), pp. 40–53.
R. Polyak, Modified barrier functions (theory and methods), Mathematical Programming, 54 (1992), pp. 177–222.
D. F. Shanno, Conjugate gradient methods with inexact searches, Mathematics of Operations Research, 3 (1978), pp. 244–256.
D. F. Shanno AND K. H. Phua, Remark on algorithm 500. Minimization of unconstrained multivariate functions, Transactions on Mathematical Software, 6 (1980), pp. 618–622.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Kluwer Academic Publishers
About this chapter
Cite this chapter
Breitfeld, M.G., Shanno, D.F. (1994). Preliminary Computational Experience with Modified Log-Barrier Functions for Large-Scale Nonlinear Programming. In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds) Large Scale Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3632-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3632-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3634-1
Online ISBN: 978-1-4613-3632-7
eBook Packages: Springer Book Archive