A convex optimization approach for solving large scale linear systems
Summary: 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.
- A class of methods for solving large convex systems
- On the Optimal Solution of Large Linear Systems
- A CONVEX APPROXIMATION METHOD FOR LARGE SCALE LINEAR INEQUALITY CONSTRAINED MINIMIZATION
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- scientific article; zbMATH DE number 3881771
- Very large scale optimization by sequential convex programming
- scientific article; zbMATH DE number 3211372
- scientific article; zbMATH DE number 1131735
- scientific article; zbMATH DE number 4108484
- scientific article; zbMATH DE number 5270607
- Algorithm 813
- Alternating projection methods.
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3686229 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Least squares data fitting with applications
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Parallel iterative methods for sparse linear systems
- Projection methods for linear systems
- Residual iterative schemes for large-scale nonsymmetric positive definite linear systems
- Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Variations on Richardson's method and acceleration
This page was built for publication: A convex optimization approach for solving large scale linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653970)
