A truncated SQP algorithm for solving nonconvex equality constrained optimization problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

A truncated SQP algorithm for solving nonconvex equality constrained optimization problems

Résumé

An algorithm for solving equality constrained optimization problems is proposed. It can deal with nonconvex functions and uses a truncated conjugate algorithm for detecting nonconvexity. The algorithm ensures convergence from remote starting point by using line-search. Numerical experiments are reported, comparing the approach with the one implemented in the trust region codes ETR and Knitro.
Fichier principal
Vignette du fichier
RR-4346.pdf (365.15 Ko) Télécharger le fichier

Dates et versions

inria-00072242 , version 1 (23-05-2006)

Licence

Paternité - Pas de modifications

Identifiants

Citer

Laurent Chauvier, Antonio Fuduli, Jean Charles Gilbert. A truncated SQP algorithm for solving nonconvex equality constrained optimization problems. High Performance Algorithms and Software for Nonlinear Optimization, G. Di Pillo; A. Murli, Jun 2001, Erice, Sicily, Italy. pp.149-176, ⟨10.1007/978-1-4613-0241-4_7⟩. ⟨inria-00072242⟩
77 Consultations
186 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More