Show simple item record

dc.contributor.authorLi, Yuyingen_US
dc.date.accessioned2007-04-23T16:32:26Z
dc.date.available2007-04-23T16:32:26Z
dc.date.issued1993-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1385en_US
dc.identifier.urihttps://hdl.handle.net/1813/6159
dc.description.abstractBound-constrained nonlinear minimization problems occur frequently in practice. Most existing methods belong to an active set type which can be slow for large scale problems. Recently, we proposed a new approach [7,6,8] which generates iterates within the strictly feasible region. The method in [8] is a trust region type and, unlike the existing trust region method for bound-constrained problems, the conditions for its strong convergence properties are consistent with algorithm implementation. A reflective technique can be included in the method. In this paper, we motivate techniques which are important for our new approach. Numerical experience on some medium size problems is included.en_US
dc.format.extent1510072 bytes
dc.format.extent425087 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleCentering, Trust Region, Reflective Techniques for Nonlinear Minimization Subject to Boundsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics