A Robust Trust Region Method for Constrained Nonlinear Programming Problems

DOI10.1137/0802016zbMath0770.90062OpenAlexW2058021091MaRDI QIDQ4018397

James V. Burke

Publication date: 16 January 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Lagrange multiplierconstrained optimizationtrust region methodquadratic approximationexact penalty function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Exact barrier function methods for Lipschitz programs, Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, Steering exact penalty methods for nonlinear programming, Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver, A trust region SQP algorithm for mixed-integer nonlinear programming, A robust trust region method for nonlinear optimization with inequality constraint, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, A new technique for inconsistent QP problems in the SQP method