A numerical implementation of an interior point method for semidefinite programming
This paper is concerned with an algorithm proposed by Alizadeh for linear semidefinite programming. The proof of convergence given by Alizadeh relies on a wrong inequality, we correct the proof. At each step, the algorithm uses a line search. To be efficient, such a line search needs the value of the derivative, we provide this value. Finally, a few numerical examples are treated.
Saved in:
Main Authors: | Benterki,Djamel, Crouzeix,Jean-Pierre, Merikhi,Bachir |
---|---|
Format: | Digital revista |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
2003
|
Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100005 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
by: Bofill,Walter Gómez, et al.
Published: (2014) -
A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
by: Garcés,Rodrigo, et al.
Published: (2012) -
A filter algorithm for nonlinear semidefinite programming
by: Gómez,Waler, et al.
Published: (2010) -
An extension of a variant of a predictor-corrector primal-dual method from linear programming to semidefinite programming
by: Bastos,F., et al.
Published: (2005) -
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling
by: LARA,H. J., et al.
Published: (2018)