A family of multi-parameterized proximal point algorithms with relaxation is introduced for linearly constrained convex minimization, with global and sublinear convergence shown from the variational inequality viewpoint.
Martinet, Br` eve communication, R´ egularisation d’in´ equations variationnelles par approximations successives, ESAIM: Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A family of multi-parameterized proximal point algorithms
A family of multi-parameterized proximal point algorithms with relaxation is introduced for linearly constrained convex minimization, with global and sublinear convergence shown from the variational inequality viewpoint.