Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems

From MaRDI portal





The authors present a new trust region algorithm for solving the nonlinear inequality constrained problems. By using duality theory, the solving of the original nonlinear inequality constrained problem is changed into solving a nonnegative constrained optimization problem. A trust region algorithm for solving the dual problem is constructed, hence, at each iteration only a quadratic subproblem with simple bound constraints is solved. Under the assumption that the sequence generated by the algorithm is contained in some bounded closed set, it is proved that the presented algorithm either terminates after finite number of iterations, or any accumulation point of the sequence is a Karush-Kuhn-Tucker point of the original optimization problem.



Cites work


Cited in
(26)


Describes a project that uses

Uses Software






This page was built for publication: Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems

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