Technique of upper relaxation type for the sum of quadratic and convex functionals

MaRDI QIDQ1901960zbMATH OpenFDO

Authors A. V. Lapin

Publication date 3 January 1996

Published in Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

coerciveconvergence of iterationsgrid problemsminimization of functionalssemi-coerciveupper relaxation methodsvariational inequalities

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25)

Review text

``In the present article, we consider the upper relaxation methods for the problem of minimization of functionals represented in the form of a sum of a quadratic functional and a convex functional \(\varphi\) semicontinuous from below. We investigate both coercive and semi-coercive problems. In the first case, the convergence of iterations to a unique solution of the problem is proved; there is established, in the second case, that the limit points of the iteration sequence are solutions to the problem in question. In the case of uniqueness of the semi-coercive problem, the entire iterational sequence converges to this solution. From the viewpoint of practical realization of the methods in question, their versions of pointwise and block upper relaxation methods under separability condition (correspondingly, ``block separability) on the functional \(\varphi\) are of most intereset\dots At the end of the article, we give some examples of grid problems approximating variational inequalities, for which the obtained results on the convergence of upper relaxation methods are applied.

Recommendations

• Successive relaxation method for minimization of functionals and some efficiency estimates
• Application of the method of conjugate subgradients to minimization of quasiconvex functions
• Construction and convergence analysis of iterative methods for variational problems with a nondifferentiable functional
• scientific article; zbMATH DE number 4174671
• Relaxed-inertial proximal point type algorithms for quasiconvex minimization

Cited in

(3)

• Application of the combined relaxation method to find equilibrium points of quasi-concave-convex functions
• Numerical solution of a subdiffusion equation with variable order time fractional derivative and nonlinear diffusion coefficient
• Successive relaxation method for minimization of functionals and some efficiency estimates

This page was built for publication: Technique of upper relaxation type for the sum of quadratic and convex functionals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901960)