A modified SQP algorithm for mathematical programming

MORARU, Vasile; ZAPOROJAN, Sergiu; ISTRATI, Daniela

DSpace Home
→
Facultatea Calculatoare, Informatică şi Microelectronică
→
Conferinţe
→
Conferinţa "Microelectronics and Computer Science"
→
2017
→
View Item

dc.contributor.author	MORARU, Vasile
dc.contributor.author	ZAPOROJAN, Sergiu
dc.contributor.author	ISTRATI, Daniela
dc.date.accessioned	2019-07-12T07:00:46Z
dc.date.available	2019-07-12T07:00:46Z
dc.date.issued	2017
dc.identifier.citation	MORARU, Vasile, ZAPOROJAN, Sergiu, ISTRATI, Daniela. A modified SQP algorithm for mathematical programming. In: Microelectronics and Computer Science: proc. of the 9th intern. conf., October 19-21, 2017. Chişinău, 2017, pp. 531-532. ISBN 978-9975-4264-8-0.	en_US
dc.identifier.isbn	978-9975-4264-8-0
dc.identifier.uri	http://repository.utm.md/handle/5014/3476
dc.description.abstract	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.	en_US
dc.language.iso	en	en_US
dc.publisher	Technical University of Moldova	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	mathematical programming	en_US
dc.subject	constrained optimization	en_US
dc.subject	merit function	en_US
dc.subject	superlinear convergence	en_US
dc.subject	Sequential Quadratic Programming	en_US
dc.subject	SQP	en_US
dc.subject	programare matematică	en_US
dc.subject	optimizare constrânsă	en_US
dc.subject	funcție de merit	en_US
dc.subject	convergență superlineară	en_US
dc.title	A modified SQP algorithm for mathematical programming	en_US
dc.type	Article	en_US