A Bi-CG type iterative method for Drazin-inverse solution of singular inconsistent nonsymmetric linear systems of arbitrary index.
A bound for the Moore-Penrose pseudoinverse of a matrix
A center of a polytope: An expository review and a parallel implementation.
A Chebyshev-like semiiteration for inconsistent linear systems.
A Contribution to the Theory of Condition.
A Direct Method for Sparse Least Squares Problems with Lower and Upper Bounds.
A Factorization Method for the Solution of Constrained Linear Least Squares Problems Allowing Subsequent Data Changes.
A fast algorithm for solving regularized total least squares problems.
A full-Newton approach to separable nonlinear least squares problems and its application to discrete least squares rational approximation.
A Kaczmarz-Kovarik algorithm for symmetric ill-conditioned matrices.
A new algorithm for the SVD of a long product of matrices and the stability of products.
A new source of structured singular value decomposition problems.
A note on computing the generalized inverse of a matrix .
A note on direct methods for approximations of sparse Hessian matrices
Necessity of computing large sparse Hessian matrices gave birth to many methods for their effective approximation by differences of gradients. We adopt the so-called direct methods for this problem that we faced when developing programs for nonlinear optimization. A new approach used in the frame of symmetric sequential coloring is described. Numerical results illustrate the differences between this method and the popular Powell-Toint method.
A novel interpretation of least squares solution.
A Numerical Procedure for Computing the Moore-Penrose Inverse.
A parallel algorithm for computing the group inverse via Perron complementation.
A parallel projection method for linear algebraic systems
A direct projection method for solving systems of linear algebraic equations is described. The algorithm is equivalent to the algorithm for minimization of the corresponding quadratic function and can be generalized for the minimization of a strictly convex function.
A Parallel Projection Method for Solving Generalized Linear Least-Squares Problems.
A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search
The Alternating Nonnegative Least Squares (ANLS) method is commonly used for solving nonnegative tensor factorization problems. In this paper, we focus on algorithmic improvement of this method. We present a Proximal ANLS (PANLS) algorithm to enforce convergence. To speed up the PANLS method, we propose to combine it with a periodic enhanced line search strategy. The resulting algorithm, PANLS/PELS, converges to a critical point of the nonnegative tensor factorization problem under mild conditions....