Pages that link to "Item:Q5176277"
From MaRDI portal
The following pages link to Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design (Q5176277):
Displaying 14 items.
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences (Q1704003) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- Coordinating Construction of Truss Structures Using Distributed Equal-Mass Partitioning (Q2914930) (← links)
- Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
