On the convergence of a new trust region algorithm
From MaRDI portal
Publication:1893505
DOI10.1007/s002110050133zbMath0828.65062OpenAlexW1999356624MaRDI QIDQ1893505
Publication date: 31 July 1995
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050133
global convergencenumerical resultssequential quadratic programming methodsuperlinear convergencepenalty functiontrust region algorithmnonlinear constrained optimization problem
Related Items
A penalty method with trust-region mechanism for nonlinear bilevel optimization problem ⋮ An augmented Lagrangian affine scaling method for nonlinear programming ⋮ Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds ⋮ An interior-point penalty active-set trust-region algorithm ⋮ Sequential penalty quadratic programming filter methods for nonlinear programming ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ An augmented Lagrangian trust region method for equality constrained optimization ⋮ A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem. ⋮ Tikhonov regularization for a general nonlinear constrained optimization problem ⋮ Nonmonotone algorithm for minimax optimization problems ⋮ A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization ⋮ 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 ⋮ Steering exact penalty methods for nonlinear programming ⋮ A new penalty method for nonlinear programming ⋮ The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction ⋮ A trust region SQP algorithm for mixed-integer nonlinear programming ⋮ Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems ⋮ A derivative-free filter method for solving nonlinear complementarity problems ⋮ A new semi-penalty method for nonlinear programming ⋮ A trust region filter method for general non-linear programming ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ A new SQP approach for nonlinear complementarity problems ⋮ A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem ⋮ A robust SQP method for mathematical programs with linear complementarity constraints ⋮ A variant of trust-region methods for unconstrained optimization ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity ⋮ A filter method for solving nonlinear complementarity problems ⋮ Recent advances in trust region algorithms ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Uses Software
