Relaxation Methods for Convex Problems

DOI10.1137/0705048zbMath0179.22701OpenAlexW2141990310MaRDI QIDQ5569914

Samuel Schechter

Publication date: 1968

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0705048

zbMATH Keywords

numerical analysis

Related Items (21)

Unnamed Item ⋮ Parallel nonlinear multisplitting relaxation methods ⋮ A Gauss-Seidel type solver for special convex programs, with application to frictional contact mechanics ⋮ Some properties of a uniformly linearly independent sequence of subspaces ⋮ A gradual rank increasing process for matrix completion ⋮ On global convergence of coordinate relaxation in the case of an unsymmetrical, diagonally dominant Jacobian ⋮ Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems ⋮ On nonlinear SOR-like methods. III: Global convergence of SOR, SSOR and USSOR methods for convex problems ⋮ A minimum norm approach for low-rank approximations of a matrix ⋮ On the approximate solution of nonlinear variational inequalities ⋮ Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations ⋮ Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method ⋮ On the solution of large, structured linear complementarity problems: the block partitioned case ⋮ Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations ⋮ Iterative Lösung nichtlinearer Gleichungssysteme und Diskretisierungsverfahren bei elliptischen Differentialgleichungen ⋮ Analyse numérique du champ magnetique d'un alternateur par éléments finis et sur-relaxation ponctuelle non linéaire ⋮ Nonlinear successive over-relaxation ⋮ Global convergence of nonlinear successive overrelaxation via linear theory ⋮ Varying relaxation parameters in nonlinear successive overrelaxation ⋮ An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems ⋮ Sur des méthodes d'optimisation par relaxation

This page was built for publication: Relaxation Methods for Convex Problems