Yayın:
Dynamic solvers for linear optimization problems

dc.contributor.authorCakir, Y.
dc.contributor.authorGuzelis, C.
dc.date.accessioned2026-01-26T07:41:39Z
dc.date.issued2004-11-08
dc.description.abstractIn this study, based on the classical gradient projection method of optimization theory a dynamic solver for linearly constrained linear optimization problems called the gradient projection network is introduced. To illustrate the performance of the network the result obtained for a special linear problem is compared with those obtained by Kennedy-Chua, Rodriguez-Vazquez and Zak's network.
dc.description.urihttps://doi.org/10.1109/siu.2004.1338320
dc.description.urihttps://dx.doi.org/10.1109/siu.2004.1338320
dc.identifier.doi10.1109/siu.2004.1338320
dc.identifier.endpage307
dc.identifier.openairedoi_dedup___::f8b22d7e9c71ab468c9eb4c07b36d066
dc.identifier.orcid0000-0002-4238-8504
dc.identifier.startpage304
dc.identifier.urihttps://hdl.handle.net/11527/63972
dc.publisherIEEE
dc.relation.ispartofProceedings of the IEEE 12th Signal Processing and Communications Applications Conference, 2004.
dc.titleDynamic solvers for linear optimization problems
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyonlar