trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
From MaRDI portal
Publication:4637824
DOI10.1080/10556788.2018.1449842zbMath1390.35364arXiv1611.04718OpenAlexW2576057118MaRDI QIDQ4637824
Felix Lenders, Andreas Potschka, Christian Kirches
Publication date: 3 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.04718
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) PDEs in connection with mathematical programming (35Q90)
Related Items
An Approximation Scheme for Distributionally Robust PDE-Constrained Optimization ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ Newton-type methods for non-convex optimization under inexact Hessian information ⋮ FEM based robust design optimization with Agros and Ārtap ⋮ trlib
Uses Software
Cites Work
- 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
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- On solving trust-region and other regularised subproblems in optimization
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Convex functional analysis
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Trust-region methods on Riemannian manifolds
- Optimal control of PDEs with regularized pointwise state constraints
- A note on preconditioners and scalar products in Krylov subspace methods for self-adjoint problems in Hilbert space
- Applications of the theory of quadratic forms in Hilbert space to the calculus of variations
- A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- Minimizing a Quadratic Over a Sphere
- Automated Derivation of the Adjoint of High-Level Transient Finite Element Programs
- OPTPDE: A Collection of Problems in PDE-Constrained Optimization
- DOLFIN
- Optimal Solvers for PDE-Constrained Optimization
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Functional Analysis, Calculus of Variations and Optimal Control
- Computing a Trust Region Step
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Algorithm 873
- Iterative Methods for Finding a Trust-region Step
- A Subspace Minimization Method for the Trust-Region Step
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Control of an Elliptic Problem with Pointwise State Constraints
- Quasi-Newton Methods and Unconstrained Optimal Control Problems
- Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems
- Solution of Sparse Indefinite Systems of Linear Equations
- ARPACK Users' Guide
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
- Trust Region Methods
- A Note on Preconditioning for Indefinite Linear Systems
- Mesh Independence for Nonlinear Least Squares Problems with Norm Constraints
- Solving the Trust-Region Subproblem using the Lanczos Method
- Efficient iterative solvers for elliptic finite element problems on nonmatching grids
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Unified form language
- Benchmarking optimization software with performance profiles.
