| Articolul precedent |
| Articolul urmator |
 |
 701 12 |
| Ultima descărcare din IBN: 2023-07-26 21:01 |
 SM ISO690:2012MORARU, Vasile, ZAPOROJAN, Sergiu, ISTRATI, Daniela. A modified SQP algorithm for mathematical programming. In: Microelectronics and Computer Science, Ed. 9, 19-21 octombrie 2017, Chisinau. Chișinău, Republica Moldova: Universitatea Tehnică a Moldovei, 2017, Ediția 9, pp. 531-532. ISBN 978-9975-4264-8-0. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Microelectronics and Computer Science Ediția 9, 2017 |
||||||
|
Conferința "Microelectronics and Computer Science" 9, Chisinau, Moldova, 19-21 octombrie 2017 | ||||||
|
||||||
| Pag. 531-532 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Recent efforts in mathematical programming have been focused a popular sequential quadratic programming (SQP) method. In this paper, a method for mathematical programs with equalities and inequalities constraints is presented, which solves two subproblems at each iterate, one a linear programming subproblem and the other is a quadratic programming (QP) subproblem. The considered method assures that the QP subproblem, is consistent. |
||||||
| Cuvinte-cheie Sequential Quadratic Programming, merit function, superlinear convergence, constrained optimization |
||||||
|
|
|
|
