A Robust Trust Region Method for Constrained Nonlinear Programming Problems
From MaRDI portal
Publication:4018397
Recommendations
- A robust trust region method for general constrained optimization
- A robust trust region method for nonlinear optimization with inequality constraint
- scientific article; zbMATH DE number 1210853
- A robust trust region algorithm for solving general nonlinear programming
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
Cited in
(15)- A trust region SQP algorithm for mixed-integer nonlinear programming
- Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- A new technique for inconsistent QP problems in the SQP method
- A robust trust region method for nonlinear optimization with inequality constraint
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Exact barrier function methods for Lipschitz programs
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- A recursive trust-region method for non-convex constrained minimization
- A robust trust region algorithm for solving general nonlinear programming
- A robust trust region method for general constrained optimization
- Steering exact penalty methods for nonlinear programming
- A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
This page was built for publication: A Robust Trust Region Method for Constrained Nonlinear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018397)