A reduced-space line-search method for unconstrained optimization via random descent directions
From MaRDI portal
(Redirected from Publication:2007776)
Recommendations
- Descent direction method with line search for unconstrained optimization in noisy environment
- Convergence of descent method without line search
- A simple sufficient descent method for unconstrained optimization
- A descent method for unconstrained optimization problems
- A dimension-reducing method for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 2045498 (Why is no real title available?)
- scientific article; zbMATH DE number 3993295 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A derivative-free trust region framework for variational data assimilation
- A matrix-free line-search algorithm for nonconvex optimization
- A reduced space branch and bound algorithm for global optimization.
- A survey of nonlinear conjugate gradient methods
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula
- An ensemble Kalman filter implementation based on modified Cholesky decomposition for inverse covariance matrix estimation
- Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
- Computing a Trust Region Step
- Conditioning of Quasi-Newton Methods for Function Minimization
- Convergence of line search methods for unconstrained optimization
- Data assimilation: methods, algorithms, and applications
- Direct search methods: Then and now
- Error bounds for tikhonov regularization in hilbert scales
- Function minimization by conjugate gradients
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- Line search algorithms for locally Lipschitz functions on Riemannian manifolds
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- Nonlinear data assimilation
- Numerical Optimization
- Numerical computation in science and engineering
- Representations of quasi-Newton matrices and their use in limited memory methods
- Sparse quasi-Newton updates with positive definite matrix completion
- Testing for chaos in deterministic systems with noise
- The steepest descent direction for the nonlinear bilevel programming problem
- Tikhonov Regularization and Total Least Squares
- Tikhonovs regularization method for ill-posed problems. A comparison of different methods for the determination of the regularization parameter
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- Trust Region Methods
- Updating Quasi-Newton Matrices with Limited Storage
- Updating the Inverse of a Matrix
Cited in
(3)
This page was built for publication: A reduced-space line-search method for unconstrained optimization via random descent directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007776)
