A convex optimization approach for solving large scale linear systems
From MaRDI portal
Publication:1653970
zbMath1392.65049MaRDI QIDQ1653970
Debora Cores, Johanna Figueroa
Publication date: 7 August 2018
Published in: Bulletin of Computational Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://drive.google.com/open?id=0B5GyVVQ6O030Z2pHbWx0cHhyTnc
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projection methods for linear systems
- Residual iterative schemes for large-scale nonsymmetric positive definite linear systems
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Variations on Richardson's method and acceleration
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Algorithm 813
This page was built for publication: A convex optimization approach for solving large scale linear systems