A Second Derivative SQP Method: Local Convergence and Practical Issues

From MaRDI portal
Publication:3058521

DOI10.1137/080744554zbMath1202.49040OpenAlexW2049300245MaRDI QIDQ3058521

Daniel P. Robinson, Nicholas I. M. Gould

Publication date: 3 December 2010

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

Full work available at URL: https://semanticscholar.org/paper/f68b049790a14d9e1e146777573a4208fdb9c968



Related Items

A superlinearly convergent hybrid algorithm for solving nonlinear programming, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, Trajectory-following methods for large-scale degenerate convex quadratic programming, An interior point method for nonlinear programming with infeasibility detection capabilities, A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares, A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results, On the use of piecewise linear models in nonlinear programming, A Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct Optimal Control, A line search exact penalty method using steering rules, A primal-dual augmented Lagrangian, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, Primal-dual active-set methods for large-scale optimization, Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization, An interior-point trust-funnel algorithm for nonlinear optimization, A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem, A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization, Some new facts about sequential quadratic programming methods employing second derivatives, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization


Uses Software