A reduced-space line-search method for unconstrained optimization via random descent directions
DOI10.1016/j.amc.2018.08.020zbMath1428.90136OpenAlexW2889797563WikidataQ57580374 ScholiaQ57580374MaRDI QIDQ2007776
Carlos Ardila, Jesus Estrada, Jose Capacho, Elias D. Nino Ruiz
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.08.020
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on necessary conditions (49M05) Newton-type methods (49M15) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- A derivative-free trust region framework for variational data assimilation
- Sparse quasi-Newton updates with positive definite matrix completion
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Tikhonovs regularization method for ill-posed problems. A comparison of different methods for the determination of the regularization parameter
- Representations of quasi-Newton matrices and their use in limited memory methods
- The steepest descent direction for the nonlinear bilevel programming problem
- A reduced space branch and bound algorithm for global optimization.
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- Direct search methods: Then and now
- Convergence of line search methods for unconstrained optimization
- Nonlinear data assimilation
- Testing for chaos in deterministic systems with noise
- Computing a Trust Region Step
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
- Updating the Inverse of a Matrix
- Updating Quasi-Newton Matrices with Limited Storage
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- Numerical Optimization
- Trust Region Methods
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
- An Ensemble Kalman Filter Implementation Based on Modified Cholesky Decomposition for Inverse Covariance Matrix Estimation
- A matrix-free line-search algorithm for nonconvex optimization
- Tikhonov Regularization and Total Least Squares
- A Nonmonotone Line Search Technique for Newton’s Method
- Error bounds for tikhonov regularization in hilbert scales
- Function minimization by conjugate gradients
- Data Assimilation
- Conditioning of Quasi-Newton Methods for Function Minimization
- An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula
This page was built for publication: A reduced-space line-search method for unconstrained optimization via random descent directions
