An Optimally Generalized Steepest-Descent Algorithm for Solving Ill-Posed Linear Systems
It is known that the steepest-descent method converges normally at the first few iterations, and then it slows down. We modify the original steplength and descent direction by an optimization argument with the new steplength as being a merit function to be maximized. An optimal iterative algorithm w...
Saved in:
Main Author: | Chein-Shan Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/154358 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient Recovery of Linear Predicted Coefficients Based on Adaptive Steepest Descent Algorithm in Signal Compression for End-to-End Communications
by: Abel Kamagara, et al.
Published: (2025-01-01) -
Hybrid Steepest-Descent Methods for Triple Hierarchical Variational Inequalities
by: L. C. Ceng, et al.
Published: (2015-01-01) -
Bounding Regions to Plane Steepest Descent Curves of Quasiconvex Families
by: Marco Longinetti, et al.
Published: (2016-01-01) -
The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems
by: Jitsupa Deepho, et al.
Published: (2014-01-01) -
Optimal Algorithms and the BFGS Updating Techniques for Solving Unconstrained Nonlinear Minimization Problems
by: Chein-Shan Liu
Published: (2014-01-01)