Optimization Online


A splitting minimization method on geodesic spaces

João Cruz Neto(jxavier***at***ufpi.edu.br)
Barnabé Lima(barnabe***at***ufpi.edu.br)
Pedro Soares Júnior (pedrosoares***at***uespi.br)

Abstract: We present in this paper the alternating minimization method on CAT(0) spaces for solving unconstraints convex optimization problems. Under the assumption that the function being minimize is convex, we prove that the sequence generated by our algorithm converges to a minimize point. The results presented in this paper are the first ones of this type that have been given for theses spaces and alternating type methods. Moreover, the method proposed in this paper is attractive for solving certain range of problems.

Keywords: 65K05, 54E50, 32Q05, 46N10

Category 1: Convex and Nonsmooth Optimization

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Category 3: Other Topics (Other )


Download: [PDF]

Entry Submitted: 04/10/2013
Entry Accepted: 04/10/2013
Entry Last Modified: 04/10/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society