Show simple item record

dc.contributor.authorMeyer, Robert R.en_US
dc.date.accessioned2012-03-15T16:16:23Z
dc.date.available2012-03-15T16:16:23Z
dc.date.created1968en_US
dc.date.issued1968
dc.identifier.citationTR28
dc.identifier.urihttp://digital.library.wisc.edu/1793/57508
dc.description.abstractA family of iterative optimization methods, which includes most of the well-known algorithms of mathematical programming, is described and analyzed with respect to the properties of its accumulation points. It is shown that these accumulation points have desirable properties under appropriate assumptions on a relevant point-to-set mapping. The conditions under which these assumptions hold are than discussed for a number of algorithms, including steepest descent, the Frank-Wolfe method, feasible direction methods, and some second-order methods. Five algorithms for a special class of nonconvex problems are also analyzed in the same manner. Finally, it is shown that the results can be extended to the case in which the subproblems constructed are only approximately solved and to algorithms which are composites of two or more algorithms.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleThe Validity of a Family of Optimization Methodsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record