Show simple item record

dc.contributor.authorIusem, Alfredo N.en
dc.contributor.authorButnariu, Danen
dc.date.accessioned2010-06-03T18:22:18Zen
dc.date.available2010-06-03T18:22:18Zen
dc.date.issued1997-02en
dc.identifier.urihttp://hdl.handle.net/10106/2350en
dc.description.abstract**Please note that the full text is embargoed** ABSTRACT: We analyze the behavior of a parallel proximal point method for solving convex optimization problems in reflexive Banach spaces. Similar algorithms were known to converge under the implicit assumption that the norm of the space is Hilbertian. We extend the area of applicability of the proximal point method to solving convex optimization problems in Banach spaces on which totally convex functions can be found. This includes the class of all smooth uniformly convex Banach spaces. Also, our convergence results leave more flexibility for the choice of the penalty function involved in the algorithm and, in this way, allow simplification of the computational procedure.en
dc.language.isoen_USen
dc.publisherUniversity of Texas at Arlingtonen
dc.relation.ispartofseriesTechnical Report;318en
dc.subjectProximal point methoden
dc.subjectBochner integralen
dc.subjectBregman distanceen
dc.subjectConvex optimization problemen
dc.subjectUniformly convex Banach spaceen
dc.subjectTotally convex functionen
dc.subject.lcshBanach spacesen
dc.subject.lcshMathematics Researchen
dc.titleOn a Proximal Point Method for Optimization in Banach Spacesen
dc.typeTechnical Reporten
dc.publisher.departmentDepartment of Mathematicsen


Files in this item

Thumbnail


This item appears in the following Collection(s)

Show simple item record