Optimization Online


Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods

Miguel Carrasco (migucarr***at***dim.uchile.cl)

Abstract: In this paper we study the hybrid extragradient method coupled with approximation and penalty schemes for minimization problems. Under certain hypotheses, that include for example the case of Tikhonov regularization, we prove convergence of the method to the solution set of our minimization problem. When we use schemes of penalization or barrier we can show convergence using the so called slow/fast parametrization hypothesis and exploiting the existence and finite length of the central path. Assuming only finite length of the central path we can prove the convergence of the scheme to a solution of the constrained minimization problem when the functions belong to a special class of functions.

Keywords: Parametric approximation; diagonal iteration; proximal point; hybrid method; global convergence.

Category 1: Convex and Nonsmooth Optimization

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: DIM-CMM N: CMM-B-07/07-185, Universidad de Chile, Jul/2007

Download: [PDF]

Entry Submitted: 07/19/2007
Entry Accepted: 07/20/2007
Entry Last Modified: 07/23/2007

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 Programming Society