A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
From MaRDI portal
Publication:2419533
DOI10.1007/s10589-019-00060-6zbMath1461.90091arXiv1712.09131OpenAlexW2779251526MaRDI QIDQ2419533
Jean-Christophe Pesquet, Giovanni Chierchia, Emilie Chouzenoux, Luis M. Briceño-Arias
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.09131
Related Items (7)
Multivariate Monotone Inclusions in Saddle Form ⋮ A proximal interior point algorithm with applications to image processing ⋮ Unnamed Item ⋮ Analysis and Numerical Solution of a Modular Convex Nash Equilibrium Problem ⋮ Explicit solution of a Lotka-Sharpe-McKendrick system involving neutral delay differential equations using the \(r\)-Lambert \(W\) function ⋮ Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging ⋮ SABRINA: a stochastic subspace majorization-minimization algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic forward-backward splitting for monotone inclusions
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- On the complexity analysis of randomized block-coordinate descent methods
- Support vector machines with adaptive \(L_q\) penalty
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- On the proximal gradient algorithm with alternated inertia
- Support-vector networks
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
- Stochastic Approximations and Perturbations in Forward-Backward Splitting for Monotone Operators
- Proximal Splitting Methods in Signal Processing
- Optimization with Sparsity-Inducing Penalties
- Nonparametric sparsity and regularization
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- Accelerated, Parallel, and Proximal Coordinate Descent
- The Group Lasso for Logistic Regression
- A Nonlocal Structure Tensor-Based Approach for Multicomponent Image Recovery Problems
- Classification and Regression Using an Outer Approximation Projection-Gradient Method
- A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation
- 10.1162/153244303322753751
- Are Loss Functions All the Same?
- Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery
- Fleshing out the generalized Lambert W function
- OnL1-Norm Multiclass Support Vector Machines
- On perturbed proximal gradient algorithms
- On the generalization of the Lambert $W$ function
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Convexity, Classification, and Risk Bounds
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
