Global and uniform convergence of subspace correction methods for some convex optimization problems

Xue Cheng Tai; Jinchao Xu

doi:10.1090/S0025-5718-01-01311-4

Global and uniform convergence of subspace correction methods for some convex optimization problems

Xue Cheng Tai, Jinchao Xu

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

105 Scopus citations

Abstract

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

Original language	English (US)
Pages (from-to)	105-124
Number of pages	20
Journal	Mathematics of Computation
Volume	71
Issue number	237
DOIs	https://doi.org/10.1090/S0025-5718-01-01311-4
State	Published - Jan 1 2002
Externally published	Yes

ASJC Scopus subject areas

Algebra and Number Theory
Computational Mathematics
Applied Mathematics

Access to Document

10.1090/S0025-5718-01-01311-4

Cite this

@article{896f0219b4b8459a9dd3d9a3bed3bda3,

title = "Global and uniform convergence of subspace correction methods for some convex optimization problems",

abstract = "This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.",

author = "Tai, {Xue Cheng} and Jinchao Xu",

note = "Generated from Scopus record by KAUST IRTS on 2023-02-15",

year = "2002",

month = jan,

day = "1",

doi = "10.1090/S0025-5718-01-01311-4",

language = "English (US)",

volume = "71",

pages = "105--124",

journal = "Mathematics of Computation",

issn = "0025-5718",

publisher = "American Mathematical Society",

number = "237",

}

TY - JOUR

T1 - Global and uniform convergence of subspace correction methods for some convex optimization problems

AU - Tai, Xue Cheng

AU - Xu, Jinchao

N1 - Generated from Scopus record by KAUST IRTS on 2023-02-15

PY - 2002/1/1

Y1 - 2002/1/1

N2 - This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

AB - This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

UR - http://www.ams.org/journal-getitem?pii=S0025-5718-01-01311-4

UR - http://www.scopus.com/inward/record.url?scp=0036003411&partnerID=8YFLogxK

U2 - 10.1090/S0025-5718-01-01311-4

DO - 10.1090/S0025-5718-01-01311-4

M3 - Article

SN - 0025-5718

VL - 71

SP - 105

EP - 124

JO - Mathematics of Computation

JF - Mathematics of Computation

IS - 237

ER -

Global and uniform convergence of subspace correction methods for some convex optimization problems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this