On the convergence of a new trust region algorithm
From MaRDI portal
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
(42)- A trust region filter method for general non-linear programming
- A penalty method with trust-region mechanism for nonlinear bilevel optimization problem
- Tikhonov regularization for a general nonlinear constrained optimization problem
- A trust region SQP algorithm for mixed-integer nonlinear programming
- An augmented Lagrangian trust region method for equality constrained optimization
- A filter method for solving nonlinear complementarity problems
- A new SQP approach for nonlinear complementarity problems
- A variant of trust-region methods for unconstrained optimization
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- A robust SQP method for mathematical programs with linear complementarity constraints
- Nonmonotone algorithm for minimax optimization problems
- A Retrospective Trust Region Algorithm with Trust Region Converging to Zero
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems
- A new penalty trust-region method for constrained optimization problems
- Recent advances in trust region algorithms
- A derivative-free filter method for solving nonlinear complementarity problems
- Sequential penalty quadratic programming filter methods for nonlinear programming
- An augmented Lagrangian affine scaling method for nonlinear programming
- A hybrid algorithm for linearly constrained minimax problems
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem.
- A variant of SQP method for inequality constrained optimization and its global convergence
- The solution of Euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- On the use of ε-most-active constraints in an exact penalty function method for nonlinear optimization
- New zero-finders for trust-region computations
- On the characterization of a class of trust-region algorithms
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization
- A hybrid algorithm for nonlinear minimax problems
- A new semi-penalty method for nonlinear programming
- A new penalty method for nonlinear programming
- Steering exact penalty methods for nonlinear programming
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- An interior-point penalty active-set trust-region algorithm
- A multiplier active-set trust-region algorithm for solving constrained optimization problem
- A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem
- scientific article; zbMATH DE number 784939 (Why is no real title available?)
- The convergence of subspace trust region methods
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)
