Stopping rules and backward error analysis for bound-constrained optimization
From MaRDI portal
Publication:639367
DOI10.1007/s00211-011-0376-1zbMath1228.65088OpenAlexW2049855671WikidataQ58185715 ScholiaQ58185715MaRDI QIDQ639367
Serge Gratton, Mélodie Mouffe, Phillipe L. Toint
Publication date: 20 September 2011
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-011-0376-1
Related Items
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist, Interplay between discretization and algebraic computation in adaptive numerical solutionof elliptic PDE problems, Non-intrusive termination of noisy optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence properties of trust region methods for linear and convex constraints
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Backward error bounds for constrained least squares problems
- Stopping criteria for iterations in finite element methods
- Estimating Computational Noise
- A New Active Set Algorithm for Box Constrained Optimization
- On the Identification of Active Constraints II: The Nonconvex Case
- Projected gradient methods for linearly constrained problems
- On the Identification of Active Constraints
- Error Analysis of Direct Methods of Matrix Inversion
- Stopping Criteria for Iterative Solvers
- Trust Region Methods
- Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints
- A Limited Memory Algorithm for Bound Constrained Optimization
- Lectures on Finite Precision Computations
- Multicriteria Optimization
- On the Compatibility of a Given Solution With the Data of a Linear System
