A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Bidabadi Narges

Educational Videos and Scientific Workshops

Scientific Information Database

ISSN: 2588-4824

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2021 | Volume:6 | Issue:26 Page(s): 0-0

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

Author(s)

Bidabadi Narges | Issue Writer Certificate

Keywords

Steepest descent method

Line search

Unconstrained optimization problem

Double parameter scaled quasi-Newton formula

Abstract

In this paper, we solve Unconstrained optimization problem using a free Line search Steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value of this matrix is not greater than the number of variables of the problem. Then, using this double parameter scaled quasi Newton formula, an explicit formula for calculating the step length in the Steepest descent method is presented and therefore, this method does not require the use of approximate methods for calculating step length. The numerical results obtained from the implementation of the algorithm in MATLAB software environment are presented for some optimization problems. These results show the efficiency of the proposed method in comparison with other existing methods.

Cites

No record.

References

No record.

Cite

APA: Copy

Bidabadi, Narges. (2021). A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 6(26 ), 0-0. SID. https://sid.ir/paper/969369/en

Vancouver: Copy

Bidabadi Narges. A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2021;6(26 ):0-0. Available from: https://sid.ir/paper/969369/en

IEEE: Copy

Narges Bidabadi, “A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 6, no. 26 , pp. 0–0, 2021, [Online]. Available: https://sid.ir/paper/969369/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops

File Not Exists.

Move to top

وبگردی