On the convergence of a new trust region algorithm
From MaRDI portal
The paper is concerned with a trust region algorithm for solving the general nonlinear constrained optimization problem. The algorithm uses the \(L_\infty\) exact penalty function with a simple technique for updating the penalty parameters, which does not need to solve any auxiliary subproblems. Global convergence of the algorithm is proved, and also it is shown that for all large numbers of iterations the algorithm preserves the local superlinear convergence of the sequential quadratic programming method. Finally, some numerical results are given.
Recommendations
- scientific article; zbMATH DE number 884984
- A new trust-region algorithm for equality constrained optimization
- Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems
- A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
- scientific article; zbMATH DE number 2114096
Cited in
(46)- Advances in trust region algorithms for constrained optimization
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem.
- On the characterization of a class of trust-region algorithms
- A penalty method with trust-region mechanism for nonlinear bilevel optimization problem
- New zero-finders for trust-region computations
- A derivative-free filter method for solving nonlinear complementarity problems
- A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem
- Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- A hybrid algorithm for nonlinear minimax problems
- Recent advances in trust region algorithms
- The convergence of subspace trust region methods
- A variant of SQP method for inequality constrained optimization and its global convergence
- A multiplier active-set trust-region algorithm for solving constrained optimization problem
- A new penalty method for nonlinear programming
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Parameter optimization using the L_ exact penalty function and strictly convex quadratic programming problems
- A trust region filter method for general non-linear programming
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- A robust SQP method for mathematical programs with linear complementarity constraints
- A variant of trust-region methods for unconstrained optimization
- A filter method for solving nonlinear complementarity problems
- An augmented Lagrangian trust region method for equality constrained optimization
- A new penalty trust-region method for constrained optimization problems
- On the use of ε-most-active constraints in an exact penalty function method for nonlinear optimization
- An interior-point penalty active-set trust-region algorithm
- An augmented Lagrangian affine scaling method for nonlinear programming
- Steering exact penalty methods for nonlinear programming
- A hybrid algorithm for linearly constrained minimax problems
- scientific article; zbMATH DE number 1070349 (Why is no real title available?)
- The solution of Euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
- scientific article; zbMATH DE number 784939 (Why is no real title available?)
- scientific article; zbMATH DE number 884984 (Why is no real title available?)
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- A new SQP approach for nonlinear complementarity problems
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- A Retrospective Trust Region Algorithm with Trust Region Converging to Zero
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- Tikhonov regularization for a general nonlinear constrained optimization problem
- Nonmonotone algorithm for minimax optimization problems
- A new semi-penalty method for nonlinear programming
- An interior-point trust-region algorithm to solve a finite nonlinear minimax problem
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds
- Sequential penalty quadratic programming filter methods for nonlinear programming
This page was built for publication: On the convergence of a new trust region algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893505)
