HEAL DSpace

Algorithms for globally solving DC minimization problems via concave programming

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Liu, S en
dc.contributor.author Papavassilopoulos, G en
dc.date.accessioned 2014-03-01T02:48:17Z
dc.date.available 2014-03-01T02:48:17Z
dc.date.issued 1995 en
dc.identifier.uri http://hdl.handle.net/123456789/33703
dc.subject Convex Function en
dc.subject Parallel Implementation en
dc.title Algorithms for globally solving DC minimization problems via concave programming en
heal.type conferenceItem en
heal.identifier.primary 10.1109/ACC.1995.532301 en
heal.identifier.secondary http://dx.doi.org/10.1109/ACC.1995.532301 en
heal.publicationDate 1995 en
heal.abstract Several methods have been proposed for solving a DC (difference of two convex functions) programming problem, but very few have been done on parallel approach. In this paper, three algorithms suitable for parallel implementation are presented to solve a DC problem via solving an equivalent concave minimization problem. To distribute the computation load as evenly as possible, a simplex subdivision en
heal.journalName American Control Conference en
dc.identifier.doi 10.1109/ACC.1995.532301 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record