Stochastic quasi-Newton with line-search regularisation
From MaRDI portal
Publication:2664231
DOI10.1016/j.automatica.2021.109503zbMath1461.93556arXiv1909.01238OpenAlexW3131338793MaRDI QIDQ2664231
Thomas B. Schön, Adrian G. Wills
Publication date: 20 April 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.01238
Gaussian processstochastic optimisationsequential Monte Carlononlinear system identificationparticle filterstochastic gradientstochastic quasi-Newton
Methods of quasi-Newton type (90C53) Nonlinear systems in control theory (93C10) Identification in stochastic control theory (93E12) Optimal stochastic control (93E20)
Related Items (2)
An overview of stochastic quasi-Newton methods for large-scale machine learning ⋮ Variational system identification for nonlinear state-space models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Particle approximations of the score and observed information matrix in state space models with application to parameter estimation
- On particle methods for parameter estimation in state-space models
- On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
- System identification of nonlinear state-space models
- Particle filters for continuous likelihood evaluation and maximisation
- Strong convergence of a stochastic approximation algorithm
- Identification of Hammerstein-Wiener models
- Minimization of functions having Lipschitz continuous first partial derivatives
- Backward Simulation Methods for Monte Carlo Statistical Inference
- Probabilistic Interpretation of Linear Solvers
- Discrete Time Stochastic Adaptive Control
- The Elimination Matrix: Some Lemmas and Applications
- Analysis of recursive stochastic algorithms
- Asymptotic behavior of the extended Kalman filter as a parameter estimator for linear systems
- RES: Regularized Stochastic BFGS Algorithm
- Probabilistic Line Searches for Stochastic Optimization
- Optimization Methods for Large-Scale Machine Learning
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Rapidly Convergent Descent Method for Minimization
- Quasi-Newton Methods and their Application to Function Minimisation
- Convergence Conditions for Ascent Methods
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
This page was built for publication: Stochastic quasi-Newton with line-search regularisation