A convex optimization approach for solving large scale linear systems
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2017, Vol 5, Issue 1
Abstract
The well-known Conjugate Gradient (CG) method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG) method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.
Authors and Affiliations
Debora Cores, Johanna Figueroa
Keywords
Related Articles
- EP ID EP243956
- DOI -
- Views 100
- Downloads 0
Redox reactions as experimental examples of ternary weak algebraic hyperstructures
A ternary hyperoperation on a set H is a 3-ary hyperoperation, which associates a subset of H with any three elements of H. In this paper, we give examples of ternary hyperoperations associated with redox reactions. We...
Motion planning algorithms, topological properties and affine approximation
The topological study of the so-called "motion planning algorithms" emerged in the 2003-2004 with the works of M. Farber. We focus here on the topological study of the set of these algorithms, when the configuration spac...
Linear programming model for solution of matrix game with payoffs trapezoidal intuitionistic fuzzy number
In this work, we considered two-person zero-sum games with fuzzy payoffs and matrix games with payoffs of trapezoidal intuitionistic fuzzy numbers (TrIFNs). The concepts of TrIFNs and their arithmetic operations were use...
Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
Inexact restoration (IR) is a well established technique for continuous minimization problems with constraints that can be applied to constrained optimization problems with specific structures. When some variables are re...
Hole-filling techniques by using minimal energy surfaces
In the last few years, several techniques to fill holes of a given surface by means of minimal energy surfaces have been proposed. In all cases, the filling patches are obtained by minimizing an `energy functional' defin...