Skip to Main content Skip to Navigation
Reports

A Global Algorithm for Nonlinear Semidefinite Programming

Abstract : In this paper we propose a global algorithm for solving nonlinear semidefinit- e programming problems. This algorithm, inspired in the classic SQP (Sequentia- lly Quadratic Programming) method, modifies the S-SDP (Sequentially Semidefini- te Programming) local method by using a nondifferentiable merit function combined with a linear search strategy.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00071913
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:14:04 PM
Last modification on : Friday, May 25, 2018 - 12:02:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:44:15 PM

Identifiers

  • HAL Id : inria-00071913, version 1

Collections

Citation

Rafael Correa, Héctor Ramírez C.. A Global Algorithm for Nonlinear Semidefinite Programming. [Research Report] RR-4672, INRIA. 2002. ⟨inria-00071913⟩

Share

Metrics

Record views

129

Files downloads

775