2013
DOI: 10.1155/2013/154358
|View full text |Cite
|
Sign up to set email alerts
|

An Optimally Generalized Steepest-Descent Algorithm for Solving Ill-Posed Linear Systems

Abstract: 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 with-vector descent direction in a Krylov subspace is constructed, of which the optimal weighting parameters are solved in closed-form to accelerate the convergence speed in solving ill-posed linear problems. The opt… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 37 publications
(50 reference statements)
0
3
0
Order By: Relevance
“…We used the ff99SB force field for the protein, and the corresponding parameters were generated using the LEaP program in AMBER. The above systems were then solvated using the TIP3P water . The resulting systems were subsequently energy minimized by the steepest descent algorithm and the conjugate gradient methods. , After that, the systems were heated and equilibrated in the NPT ensemble at a pressure of 1 bar and a temperature of 300 K for 1 ns, and then the molecular dynamics (MD) simulations were carried out in the canonical ( NVT ) ensemble at 300 K for 20 ns using the AMBER18 program . During the MD simulation, the distance constraints were applied on all bonds involving H atoms using SHAKE .…”
Section: Computational Detailsmentioning
confidence: 99%
“…We used the ff99SB force field for the protein, and the corresponding parameters were generated using the LEaP program in AMBER. The above systems were then solvated using the TIP3P water . The resulting systems were subsequently energy minimized by the steepest descent algorithm and the conjugate gradient methods. , After that, the systems were heated and equilibrated in the NPT ensemble at a pressure of 1 bar and a temperature of 300 K for 1 ns, and then the molecular dynamics (MD) simulations were carried out in the canonical ( NVT ) ensemble at 300 K for 20 ns using the AMBER18 program . During the MD simulation, the distance constraints were applied on all bonds involving H atoms using SHAKE .…”
Section: Computational Detailsmentioning
confidence: 99%
“…Image reconstruction is an ill-posed problem, and it is generally known that Tikhonov regularization is an efficient way to solve ill-posed problems. Its basic idea is to transform equation (1) into an optimization problem [20][21][22][23][24]:…”
Section: Image Reconstructionmentioning
confidence: 99%
“…In this paper, an improved super-memory gradient (ISMG) method was introduced to solve objective function of (15). Most of the well-known iterative algorithms for solving (15) take the following form [46][47][48][49]:…”
Section: The Algorithm For Solving Unconstrained Optimization Problemmentioning
confidence: 99%