Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
From MaRDI portal
Publication:3350686
DOI10.1137/0728026zbMATH Open0726.65068OpenAlexW1973431552MaRDI QIDQ3350686FDOQ3350686
Authors: Marc J. A. Lescrenier 
Publication date: 1991
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0728026
Recommendations
- On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
- A Trust Regional Algorithm for Bound Constrained Minimization
- scientific article; zbMATH DE number 1131709
- A globally convergent trust region algorithm for optimization with general constraints and simple bounds.
- Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems
Newton's methodtrust region algorithmquadratic convergencesuperlinear convergencebound constrained problemsstrict complementarity
Cited In (21)
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- A decomposition method for large-scale box constrained optimization
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set limited memory BFGS algorithm for bound constrained optimization
- An active-set projected trust region algorithm for box constrained optimization problems
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Globally convergent DC trust-region methods
- New active set identification for general constrained optimization and minimax problems
- A feasible trust region method for nonlinear inequality constrained optimization
- A Trust Regional Algorithm for Bound Constrained Minimization
- Properties of restricted NCP functions for nonlinear complementarity problems
- A trust region method based on a new affine scaling technique for simple bounded optimization
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- On unconstrained and constrained stationary points of the implicit Lagrangian
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
This page was built for publication: Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3350686)
