Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method

DOI10.1016/S0165-1684(03)00002-1zbMath1144.65303MaRDI QIDQ947468

Isao Yamada, Kohichi Sakaniwa, Konstantinos Slavakis

Publication date: 2 October 2008

Published in: Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (12)

The hybrid steepest descent method for solving variational inequality over triple hierarchical problems ⋮ Nonlinear damped oscillators on Riemannian manifolds: fundamentals ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem ⋮ Fixed point optimization algorithm and its application to power control in CDMA data networks ⋮ Outer approximation methods for solving variational inequalities in Hilbert space ⋮ Algorithms for solving the variational inequality problem over the triple hierarchical problem ⋮ Strong convergence of an iterative algorithm for hierarchical problems ⋮ A generalized hybrid steepest-descent method for variational inequalities in Banach spaces ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings ⋮ Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping ⋮ Triple-hierarchical problems with variational inequality

This page was built for publication: Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method