{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2910883","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2910883","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2910883","kernelVersion":"v1","immutable":true,"modified":"2026-04-03T14:31:03Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2910883","name":"Fast multiple-splitting algorithms for convex optimization","headline":"Fast multiple-splitting algorithms for convex optimization","description":"scientific article; zbMATH DE number 6081235","url":"https://portal.mardi4nfdi.de/entity/Q2910883","datePublished":"2012-09-12","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q233995"},{"@id":"https://portal.mardi4nfdi.de/entity/Q888301"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q60872"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/090780705","url":"https://doi.org/10.1137/090780705"},"sameAs":["https://doi.org/10.1137/090780705"],"comment":"To solve finite-dimensional convex optimization problems, the authors develop two different classes of general multiple-splitting algorithms based on alternating directions and alternating linearization techniques. Under certain conditions, the complexity bounds on the number of iterations required to obtain an \\(\\epsilon\\)-optimal solution for these algorithms are obtained, namely, \\(O(1/\\epsilon)\\) and \\(O(1/\\sqrt{\\epsilon})\\), respectively. Moreover, all algorithms proposed in this paper are parallelizable. Numerical results are presented to demonstrate the computational performance of these algorithms."},"provenance":{"prov:generatedAtTime":"2026-04-03T14:31:03Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}