Global convergence of a trust-region algorithm for inequality constrained optimization

From MaRDI portal





The authors propose a trust-region algorithm for nonlinear programming problems with \(n\) variables and \(m\) nonlinear inequality constraints \((m\leq n)\). New equivalent Karush-Kuhn-Tucker (KKT) conditions are derived as a basis of the algorithm. The global convergence is established. At least one accumulation point of the sequence produced by the algorithm is a KKT point.




Cited in
(15)








This page was built for publication: Global convergence of a trust-region algorithm for inequality constrained optimization

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