Pages that link to "Item:Q4580494"
From MaRDI portal
The following pages link to Parallel Selective Algorithms for Nonconvex Big Data Optimization (Q4580494):
Displaying 25 items.
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- An adaptive partial linearization method for optimization problems on product sets (Q1686667) (← links)
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks (Q1694193) (← links)
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training (Q1790674) (← links)
- On the solution of monotone nested variational inequalities (Q2105292) (← links)
- Distributed algorithms for convex problems with linear coupling constraints (Q2173513) (← links)
- A framework for parallel and distributed training of neural networks (Q2181060) (← links)
- Asynchronous parallel algorithms for nonconvex optimization (Q2205974) (← links)
- Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
- Distributed semi-supervised support vector machines (Q2418194) (← links)
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems (Q2419531) (← links)
- Distributed nonconvex constrained optimization over time-varying digraphs (Q2425183) (← links)
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares (Q2796799) (← links)
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- (Q4637005) (← links)
- (Q4969198) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- (Q5053180) (← links)
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation (Q5071108) (← links)
- Combining approximation and exact penalty in hierarchical programming (Q5093688) (← links)
- Decentralized Dictionary Learning Over Time-Varying Digraphs (Q5214231) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- Localization and approximations for distributed non-convex optimization (Q6191109) (← links)
