Algorithm 20.1: local SQP algorithm. More...

Functions
function	localSqp (in problem, in x0, in lambda0, in eps, in maxiter)
	Applies the local SQP method to solve $\min_x f(x)$ subject to $h(x)=0,$ where $f:\mathbb{R}^n \to \mathbb{R}$ and $h:\mathbb{R}^n \to \mathbb{R}^m$ . More...

Detailed Description

Algorithm 20.1: local SQP algorithm.

Implementation of algorithm 20.1 of [1]

Definition in file localSqp.m.

Function Documentation

Applies the local SQP method to solve

$\min_x f(x)$

subject to

$h(x)=0,$

where $f:\mathbb{R}^n \to \mathbb{R}$ and $h:\mathbb{R}^n \to \mathbb{R}^m$ .

Parameters

problem	the name of the Octave function defining f(x), h(x) and their derivatives. The funtion has two arguments: x and index. If index=0, the objective function and its derivatives are evaluated. If index= , the constraint and its derivtives are evaluated.
x0	starting primal point (nx1)
lambda0	starting dual point (mx1)
eps	algorithm stops if $\\|\nabla L(x_k,\lambda_k\\| \leq \varepsilon$ and $\\|h(x_k)\\|^2$ .
maxiter	maximum number of iterations (default: 100)