Variable projection algorithms with sparse constraint for separable nonlinear models
From MaRDI portal
Cites work
- A Regularized Variable Projection Algorithm for Separable Nonlinear Least Squares Problems
- Algorithms for Separable Nonlinear Least Squares Problems
- Efficient Quadratic Penalization Through the Partial Minimization Technique
- Embedded Point Iteration Based Recursive Algorithm for Online Identification of Nonlinear Regression Models
- First-order methods in optimization
- Greedy Search Method for Separable Nonlinear Models Using Stage Aitken Gradient Descent and Least Squares Algorithms
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Neural network for a class of sparse optimization with L₀-regularization
- Regularization and Variable Selection Via the Elastic Net
- Robust and scalable methods for the dynamic mode decomposition
- Separable multi‐innovation stochastic gradient estimation algorithm for the nonlinear dynamic responses of systems
- Separable nonlinear least squares: the variable projection method and its applications
- Sparse principal component analysis via variable projection
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
- Tikhonov regularized variable projection algorithms for separable nonlinear least squares problems
- Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection
- Variable Projection for NonSmooth Problems
This page was built for publication: Variable projection algorithms with sparse constraint for separable nonlinear models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631010)