## Abstract

In the literature, the proof of superlinear convergence of approximate Newton or SQP methods for solving nonlinear programming problems requires twice smoothness of the objective and constraint functions. Sometimes, the second-order derivatives of those functions are required to be Lipschitzian. In this paper, we present approximate Newton or SQP methods for solving nonlinear programming problems whose objective and constraint functions have locally Lipschitzian derivatives, and establish Q-superlinear convergence of these methods under the assumption that these derivatives are semismooth. This assumption is weaker than the second-order differentiability. The extended linear-quadratic programming problem in the fully quadratic case is an example of nonlinear programming problems whose objective functions have semismooth but not smooth derivatives.

Original language | English |
---|---|

Pages (from-to) | 277-294 |

Number of pages | 18 |

Journal | Mathematical Programming |

Volume | 64 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - 1 Mar 1994 |

Externally published | Yes |

## Keywords

- Iteration
- Semismoothness
- Superlinear convergence

## ASJC Scopus subject areas

- Applied Mathematics
- Mathematics(all)
- Safety, Risk, Reliability and Quality
- Management Science and Operations Research
- Software
- Computer Graphics and Computer-Aided Design
- Computer Science(all)

## Fingerprint

Dive into the research topics of 'Superlinearly convergent approximate Newton methods for LC^{1}optimization problems'. Together they form a unique fingerprint.