2009
DOI: 10.1016/j.amc.2009.08.058
|View full text |Cite
|
Sign up to set email alerts
|

A descent algorithm without line search for unconstrained optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…As shown in Section 1, there are many feasible largescale optimization algorithms. Take the GD algorithm [27] for instance, the control parameters can be optimized using the following formulas:…”
Section: Numerical Modelmentioning
confidence: 99%
“…As shown in Section 1, there are many feasible largescale optimization algorithms. Take the GD algorithm [27] for instance, the control parameters can be optimized using the following formulas:…”
Section: Numerical Modelmentioning
confidence: 99%
“…Compared with [10], the extended algorithm has more effective numerical perfermance, so it is effective.…”
Section: Resultsmentioning
confidence: 99%
“…In this paper, we extended the descent algorithm without line search of [10] to more general case, and got its global convergence. Compared with [10], the extended algorithm has more effective numerical perfermance, so it is effective.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations