Some new facts about sequential quadratic programming methods employing second derivatives
DOI10.1080/10556788.2016.1177528zbMATH Open1349.90764OpenAlexW2346366034MaRDI QIDQ2829576FDOQ2829576
Publication date: 8 November 2016
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1177528
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- An inexact Newton method for nonconvex equality constrained optimization
- Newton-Type Methods for Optimization and Variational Problems
- Abstract Newtonian Frameworks and Their Applications
- Numerical methods for large-scale nonlinear optimization
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A robust sequential quadratic programming method
- A Second Derivative SQP Method: Global Convergence
- A Second Derivative SQP Method: Local Convergence and Practical Issues
- Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization
- An Inexact SQP Method for Equality Constrained Optimization
- A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
- Newton-type methods: a broader view
Cited In (1)
Uses Software
This page was built for publication: Some new facts about sequential quadratic programming methods employing second derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829576)
