Accelerated double direction method for solving unconstrained optimization problems (Q1719483)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7017729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerated double direction method for solving unconstrained optimization problems |
scientific article; zbMATH DE number 7017729 |
Statements
Accelerated double direction method for solving unconstrained optimization problems (English)
0 references
8 February 2019
0 references
Summary: An iterative method for solving a minimization problem of unconstrained optimization is presented. This multistep curve search method uses the specific form of iteration with two direction parameters, the approximation of Hessian by appropriately constructed diagonal matrix, and the inexact line search procedure. It is proved that constructed numerical process is well defined under some assumptions. Considering certain conditions, the method is linearly convergent for uniformly convex and strictly convex quadratic functions. Numerical results arising from defined algorithms are also presented and analyzed.
0 references
0 references
0 references
0 references
0.9207785
0 references
0.9148166
0 references
0.90517855
0 references
0.8978482
0 references
0.89637476
0 references
0.8959756
0 references
0.8940103
0 references
0 references
0.8932387
0 references
