Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design

DOI10.1007/978-3-642-29210-1_5zbMath1306.74043OpenAlexW1737373496WikidataQ61661692 ScholiaQ61661692MaRDI QIDQ5176277

Peter Richtárik, Martin Takáč

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_5

Mathematics Subject Classification ID

Related Items (13)

Inexact coordinate descent: complexity and preconditioning ⋮ On optimal probabilities in stochastic coordinate descent methods ⋮ Distributed Block Coordinate Descent for Minimizing Partially Separable Functions ⋮ Accelerating block coordinate descent methods with identification strategies ⋮ A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming ⋮ Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences ⋮ A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints ⋮ Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function ⋮ Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization ⋮ On the complexity analysis of randomized block-coordinate descent methods ⋮ On the complexity of parallel coordinate descent ⋮ A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions ⋮ Parallel coordinate descent methods for big data optimization

Uses Software

• CUDA

This page was built for publication: Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design