| Articolul precedent |
| Articolul urmator |
 |
 226 8 |
| Ultima descărcare din IBN: 2023-02-01 14:15 |
 SM ISO690:2012GÂRLĂ, Eugeniu. Optimal complexity algorithm for a class of problems of non-linear optimization. In: Conference on Applied and Industrial Mathematics: CAIM 2021, 17-18 septembrie 2021, Iași, România. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2021, Ediţia a 28-a, p. 57. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference on Applied and Industrial Mathematics Ediţia a 28-a, 2021 |
||||||
|
Conferința "Conference on Applied and Industrial Mathematics" Iași, România, Romania, 17-18 septembrie 2021 | ||||||
|
||||||
| Pag. 57-57 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
The paper analyses a class of nonlinear optimization problems with special restrictions, we propose a concept for solving the auxiliary problem, for which we calculate complexity, and we also assess the maximum number of elementary operations and describe the optimal algorithm for performing numerical calculations. The study constructs an algorithm for solving nonlinear optimization problems with complexity O(n3:5) . |
||||||
|
|
|
|
