Variable projection algorithms with sparse constraint for separable nonlinear models
From MaRDI portal
Publication:6631010
DOI10.1007/s11768-023-00194-3MaRDI QIDQ6631010
Si-Qing Cheng, Min Gan, Guangyong Chen, Hui-Lang Xu, Jing Chen
Publication date: 31 October 2024
Published in: Control Theory and Technology (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Sparse Principal Component Analysis via Variable Projection
- Tikhonov regularized variable projection algorithms for separable nonlinear least squares problems
- Algorithms for Separable Nonlinear Least Squares Problems
- Separable nonlinear least squares: the variable projection method and its applications
- First-Order Methods in Optimization
- A Regularized Variable Projection Algorithm for Separable Nonlinear Least Squares Problems
- Efficient Quadratic Penalization Through the Partial Minimization Technique
- Separable multi‐innovation stochastic gradient estimation algorithm for the nonlinear dynamic responses of systems
- Robust and Scalable Methods for the Dynamic Mode Decomposition
- Variable Projection for NonSmooth Problems
- Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection
- Regularization and Variable Selection Via the Elastic Net
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
- Neural network for a class of sparse optimization with \(L_0\)-regularization
- Embedded Point Iteration Based Recursive Algorithm for Online Identification of Nonlinear Regression Models
- Greedy Search Method for Separable Nonlinear Models Using Stage Aitken Gradient Descent and Least Squares Algorithms
This page was built for publication: Variable projection algorithms with sparse constraint for separable nonlinear models