NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A convergence theory for a class of nonlinear programming problems.A recent convergence theory of Elkin concerning methods for unconstrained minimization is extended to a certain class of nonlinear programming problems. As in Elkin's original approach, the analysis of a variety of step-length algorithms is treated entirely separately from that of several direction algorithms. This allows for their combination into many different methods for solving the constrained problem. These include some of the methods of Rosen and Zoutendijk. We also extend the results of Topkis and Veinott to nonconvex sets and drop their requirement of the uniform feasibility of a subsequence of the search directions.
Document ID
19730043808
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Rauch, S. W.
(New Brunswick, University Fredericton, New Brunswick, Canada)
Date Acquired
August 7, 2013
Publication Date
March 1, 1973
Publication Information
Publication: SIAM Journal on Numerical Analysis
Volume: 10
Subject Category
Mathematics
Accession Number
73A28610
Funding Number(s)
CONTRACT_GRANT: NGL-21-002-008
CONTRACT_GRANT: NRC A-7909
CONTRACT_GRANT: NSF GJ-231
CONTRACT_GRANT: NRC C-1040
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available