Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds

DOI10.1137/0726044MaRDI QIDQ3827481zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0726044

zbMATH Keywords

constrained optimizationglobal convergenceCauchy pointcorrectiontrust region algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(13)

• Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
• 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.
• Multi-step quasi-Newton methods for optimization
• A feasible trust-region algorithm for inequality constrained optimization
• On iterative algorithms for linear least squares problems with bound constraints
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
• The use of alternation and recurrences in two-step quasi-Newton methods
• Globally convergent DC trust-region methods
• Erratum to: A trust region method for solving semidefinite programs
• Corrigendum to ``Solving equations via the trust region and its application to a class of stochastic linear complementarity problems [Comput. Math. Appl. 61 (2011) 1646-1664]
• A feasible direction method for the semidefinite program with box constraints
• A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization

This page was built for publication: Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827481)