A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm

Miguel Carrasco; Karine Pichard

doi:10.1080/02331930801951389

A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm

Research output: Contribution to journal › Article › peer-review

Abstract

In this note, an inertial and relaxed version of a diagonal hybrid projectionproximal point algorithm is considered, in order to find the minimum of a function f approximated by a sequence of functions (in general, smoother than f or taking into account some constraints of the problem). Two convergence theorems are proved under different kind of assumptions, which allows to apply the method in various cases.

Original language	American English
Pages (from-to)	561-574
Number of pages	14
Journal	Optimization
Volume	59
Issue number	4
DOIs	https://doi.org/10.1080/02331930801951389
State	Published - 1 Jan 2010

Keywords

Diagonal iteration
Global convergence
Hybrid method
Inertial term
Parametric approximation
Proximal point
Relaxation

Access to Document

10.1080/02331930801951389

Fingerprint Dive into the research topics of 'A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm'. Together they form a unique fingerprint.

Cite this

@article{41c04cdb3a834cde96d8000bb5316561,

title = "A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm",

abstract = "In this note, an inertial and relaxed version of a diagonal hybrid projectionproximal point algorithm is considered, in order to find the minimum of a function f approximated by a sequence of functions (in general, smoother than f or taking into account some constraints of the problem). Two convergence theorems are proved under different kind of assumptions, which allows to apply the method in various cases.",

keywords = "Diagonal iteration, Global convergence, Hybrid method, Inertial term, Parametric approximation, Proximal point, Relaxation, Diagonal iteration, Global convergence, Hybrid method, Inertial term, Parametric approximation, Proximal point, Relaxation",

author = "Miguel Carrasco and Karine Pichard",

year = "2010",

month = jan,

day = "1",

doi = "10.1080/02331930801951389",

language = "American English",

volume = "59",

pages = "561--574",

journal = "Optimization",

issn = "0233-1934",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

T1 - A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm

AU - Carrasco, Miguel

AU - Pichard, Karine

PY - 2010/1/1

Y1 - 2010/1/1

N2 - In this note, an inertial and relaxed version of a diagonal hybrid projectionproximal point algorithm is considered, in order to find the minimum of a function f approximated by a sequence of functions (in general, smoother than f or taking into account some constraints of the problem). Two convergence theorems are proved under different kind of assumptions, which allows to apply the method in various cases.

AB - In this note, an inertial and relaxed version of a diagonal hybrid projectionproximal point algorithm is considered, in order to find the minimum of a function f approximated by a sequence of functions (in general, smoother than f or taking into account some constraints of the problem). Two convergence theorems are proved under different kind of assumptions, which allows to apply the method in various cases.

KW - Diagonal iteration

KW - Global convergence

KW - Hybrid method

KW - Inertial term

KW - Parametric approximation

KW - Proximal point

KW - Relaxation

KW - Diagonal iteration

KW - Global convergence

KW - Hybrid method

KW - Inertial term

KW - Parametric approximation

KW - Proximal point

KW - Relaxation

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=77952493925&origin=inward

U2 - 10.1080/02331930801951389

DO - 10.1080/02331930801951389

M3 - Article

VL - 59

SP - 561

EP - 574

JO - Optimization

JF - Optimization

SN - 0233-1934

IS - 4

ER -