A reduced-space line-search method for unconstrained optimization via random descent directions
type: Item
instance of: scholarly article
title: A reduced-space line-search method for unconstrained optimization via random descent directions
zbMATH Open document ID: 1428.90136
author: Carlos Ardila
author: Jesus Estrada
author: Jose Capacho
author: Elias D. Nino Ruiz
published in: Applied Mathematics and Computation
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49K10
Mathematics Subject Classification ID: 49M05
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7135194
zbMATH Keywords: reduced-space optimization
zbMATH Keywords: line search
zbMATH Keywords: random descent directions
describes a project that uses: GQTPAR
describes a project that uses: L-BFGS
describes a project that uses: EnKF-MC
Wikidata QID: Q57580374
MaRDI profile type: Publication
full work available at URL: j.amc.2018.08.020
OpenAlex ID: W2889797563
cites work: Data Assimilation
cites work: An Ensemble Kalman Filter Implementation Based on Modified Cholesky Decomposition for Inverse Covariance Matrix Estimation
cites work: Q4721081
cites work: Numerical Optimization
cites work: The steepest descent direction for the nonlinear bilevel programming problem
cites work: Q5479892
cites work: Function minimization by conjugate gradients
cites work: Direct search methods: Then and now
cites work: A truncated Newton method with non-monotone line search for unconstrained optimization
cites work: Conditioning of Quasi-Newton Methods for Function Minimization
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
cites work: A reduced space branch and bound algorithm for global optimization.
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
cites work: Trust Region Methods
cites work: Computing a Trust Region Step
cites work: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
cites work: Convergence of line search methods for unconstrained optimization
cites work: A matrix-free line-search algorithm for nonconvex optimization
cites work: Representations of quasi-Newton matrices and their use in limited memory methods
cites work: Numerical computation in science and engineering
cites work: Updating the Inverse of a Matrix
cites work: Sparse quasi-Newton updates with positive definite matrix completion
cites work: Matrix factorizations in optimization of nonlinear functions subject to linear constraints
cites work: Tikhonov Regularization and Total Least Squares
cites work: Tikhonovs regularization method for ill-posed problems. A comparison of different methods for the determination of the regularization parameter
cites work: Error bounds for tikhonov regularization in hilbert scales
cites work: Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
cites work: Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
cites work: Q4448872
cites work: An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula
cites work: A derivative-free trust region framework for variational data assimilation
cites work: Testing for chaos in deterministic systems with noise
cites work: Nonlinear data assimilation
DOI: 10.1016/J.AMC.2018.08.020
description: scientific article; zbMATH DE number 7135194