Selective linearization for multi-block statistical learning
From MaRDI portal
Publication:2030520
DOI10.1016/j.ejor.2020.12.010zbMath1487.65064OpenAlexW3112330086MaRDI QIDQ2030520
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.010
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Smoothing proximal gradient method for general structured sparse regression
- Proximal methods for the latent group lasso penalty
- An augmented Lagrangian method for distributed optimization
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Proximal average approximated incremental gradient descent for composite penalty regularized empirical risk minimization
- Rate of convergence of the bundle method
- Operations research and data mining
- Application of SVM and ANN for image retrieval
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Monotone Operators and the Proximal Point Algorithm
- Proximal Decomposition Via Alternating Linearization
- A Selective Linearization Method For Multiblock Convex Optimization
- Regularization and Variable Selection Via the Elastic Net
- The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
