skip to content
Coordination complexity of parallel price-directive decomposition Preview this item
ClosePreview this item
Checking...

Coordination complexity of parallel price-directive decomposition

Author: Michael D Grigoriadis; Leonid Khachiyan
Publisher: New Brunswick, N.J. : Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research, [1994]
Series: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Parallel price directive decomposition (PPD) methods for the approximate solution of block-angular convex resource sharing problems are considered. This general model in structured optimization consists of K nonempty disjoint compact sets called 'blocks' and M nonnegative-valued convex 'coupling' inequalities. It has a number of applications in combinatorial optimization, network flows, scheduling,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Michael D Grigoriadis; Leonid Khachiyan
OCLC Number: 33248831
Notes: "April 1994."
Description: 23 pages : illustrations ; 28 cm.
Series Title: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Responsibility: M.D. Grigoriadis and L.G. Khachiyan.

Abstract:

Abstract: "Parallel price directive decomposition (PPD) methods for the approximate solution of block-angular convex resource sharing problems are considered. This general model in structured optimization consists of K nonempty disjoint compact sets called 'blocks' and M nonnegative-valued convex 'coupling' inequalities. It has a number of applications in combinatorial optimization, network flows, scheduling, communication networks, engineering design, and finance. This paper studies the coordination complexity of PDD approximation methods, i.e., the number of iterations required to solve the general resource sharing problem to a fixed relative accuracy, as a function of K and M. First, a simple PDD method based on the classical logarithmic potential function is presented and analyzed. For a fixed accuracy, its coordination complexity is shown to be O(M ln M), which is within a logarithmic factor of the best possible bound for any PDD method that works with the original blocks. An important property of the logarithmic-potential PDD method is that its coordination complexity depends neither on the 'width' nor on the dimension of the blocks. Second, polylogarithmically-matching upper and lower coordination complexity bounds are presented for a wider class of PDD methods in which each block can be partially restricted by the coupling constraints. The upper bound for this class of PDD is obtained by a combined method, which uses either the logarithmic or the exponential potential function, depending on the number of coupling constraints per block."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/33248831> # Coordination complexity of parallel price-directive decomposition
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "33248831" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/38480444#Place/new_brunswick_n_j> ; # New Brunswick, N.J.
   schema:about <http://id.worldcat.org/fast/868980> ; # Combinatorial optimization
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/38480444#Person/khachiyan_leonid> ; # Leonid Khachiyan
   schema:creator <http://experiment.worldcat.org/entity/work/data/38480444#Person/grigoriadis_michael_d> ; # Michael D. Grigoriadis
   schema:datePublished "1994" ;
   schema:description "Abstract: "Parallel price directive decomposition (PPD) methods for the approximate solution of block-angular convex resource sharing problems are considered. This general model in structured optimization consists of K nonempty disjoint compact sets called 'blocks' and M nonnegative-valued convex 'coupling' inequalities. It has a number of applications in combinatorial optimization, network flows, scheduling, communication networks, engineering design, and finance. This paper studies the coordination complexity of PDD approximation methods, i.e., the number of iterations required to solve the general resource sharing problem to a fixed relative accuracy, as a function of K and M. First, a simple PDD method based on the classical logarithmic potential function is presented and analyzed. For a fixed accuracy, its coordination complexity is shown to be O(M ln M), which is within a logarithmic factor of the best possible bound for any PDD method that works with the original blocks. An important property of the logarithmic-potential PDD method is that its coordination complexity depends neither on the 'width' nor on the dimension of the blocks. Second, polylogarithmically-matching upper and lower coordination complexity bounds are presented for a wider class of PDD methods in which each block can be partially restricted by the coupling constraints. The upper bound for this class of PDD is obtained by a combined method, which uses either the logarithmic or the exponential potential function, depending on the number of coupling constraints per block.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/38480444> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/38480444#Series/technical_report_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> ; # Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/38480444#Series/technical_report> ; # Technical report ;
   schema:name "Coordination complexity of parallel price-directive decomposition"@en ;
   schema:productID "33248831" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/33248831#PublicationEvent/new_brunswick_n_j_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research_1994> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/38480444#Agent/rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> ; # Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/33248831> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/38480444#Agent/rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> # Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research
    a bgn:Agent ;
   schema:name "Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480444#Organization/rutgers_university_department_of_computer_science_laboratory_for_computer_science_research> # Rutgers University. Department of Computer Science. Laboratory for Computer Science Research.
    a schema:Organization ;
   schema:name "Rutgers University. Department of Computer Science. Laboratory for Computer Science Research." ;
    .

<http://experiment.worldcat.org/entity/work/data/38480444#Person/grigoriadis_michael_d> # Michael D. Grigoriadis
    a schema:Person ;
   schema:familyName "Grigoriadis" ;
   schema:givenName "Michael D." ;
   schema:name "Michael D. Grigoriadis" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480444#Person/khachiyan_leonid> # Leonid Khachiyan
    a schema:Person ;
   schema:familyName "Khachiyan" ;
   schema:givenName "Leonid" ;
   schema:name "Leonid Khachiyan" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480444#Place/new_brunswick_n_j> # New Brunswick, N.J.
    a schema:Place ;
   schema:name "New Brunswick, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/38480444#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/38480444#Organization/rutgers_university_department_of_computer_science_laboratory_for_computer_science_research> ; # Rutgers University. Department of Computer Science. Laboratory for Computer Science Research.
   schema:hasPart <http://www.worldcat.org/oclc/33248831> ; # Coordination complexity of parallel price-directive decomposition
   schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480444#Series/technical_report_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> # Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/33248831> ; # Coordination complexity of parallel price-directive decomposition
   schema:name "Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;" ;
    .

<http://id.worldcat.org/fast/868980> # Combinatorial optimization
    a schema:Intangible ;
   schema:name "Combinatorial optimization"@en ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.