A global algorithm for nonlinear semidefinite programming

Author	dc.contributor.author	Correa, Rafael
Author	dc.contributor.author	Ramírez Cabrera, Héctor	es_CL
Admission date	dc.date.accessioned	2007-04-18T16:00:00Z
Available date	dc.date.available	2007-04-18T16:00:00Z
Publication date	dc.date.issued	2004
Cita de ítem	dc.identifier.citation	SIAM JOURNAL ON OPTIMIZATION 15 (1): 303-318 2004	en
Identifier	dc.identifier.issn	1052-6234
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/124509
Abstract	dc.description.abstract	In this paper we propose a global algorithm for solving nonlinear semidefinite programming problems. This algorithm, inspired by the classic SQP (sequentially quadratic programming) method, modifies the S-SDP (sequentially semidefinite programming) local method by using a nondifferentiable merit function combined with a line search strategy.	en
Lenguage	dc.language.iso	en	en
Publisher	dc.publisher	SIAM PUBLICATIONS	en
Keywords	dc.subject	2ND-ORDER OPTIMALITY CONDITIONS	en
Título	dc.title	A global algorithm for nonlinear semidefinite programming	en
Document type	dc.type	Artículo de revista