A convex optimization approach for solving large scale linear systems
From MaRDI portal
Publication:1653970
Recommendations
- 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
Cites work
- 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?)
- Algorithm 813
- Alternating projection methods.
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- 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
Cited in
(3)
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)