A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
From MaRDI portal
Publication:396257
DOI10.1016/j.cam.2014.02.035zbMath1293.65042OpenAlexW2134414648WikidataQ58832746 ScholiaQ58832746MaRDI QIDQ396257
Daniela di Serafino, Valentina De Simone
Publication date: 8 August 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.02.035
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Preconditioners for iterative methods (65F08)
Related Items (3)
A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization ⋮ On preconditioner updates for sequences of saddle-point linear systems ⋮ A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization
Uses Software
Cites Work
- Unnamed Item
- Matrix-free interior point method
- Matrix-free preconditioning using partial matrix estimation
- Convergence properties of trust region methods for linear and convex constraints
- Approximate inverse preconditioning for shifted linear systems
- An active set feasible method for large-scale minimization problems with bound constraints
- Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Efficient Preconditioner Updates for Shifted Linear Systems
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Preconditioning of Truncated-Newton Methods
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Newton's Method for Large Bound-Constrained Optimization Problems
- Incomplete Cholesky Factorizations with Limited Memory
- A Nonmonotone Line Search Technique for Newton’s Method
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A Preconditioning Framework for Sequences of Diagonally Modified Linear Systems Arising in Optimization
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- CUTEr and SifDec
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- New updates of incomplete LU factorizations and applications to large nonlinear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
