## Globally and superlinearly convergent algorithms for nonlinear programming |

### From inside the book

Try this search over all volumes: **Topkis**

Results 1-0 of 0

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

accumulation point active constraints algorithms presented bounded Chapter Constrained Optimization convergence properties convergent exact penalty convergent quasi-Newton algorithms convex function Convex Programming define definition denote descent direction exact penalty algorithms exact penalty function exists feasible point finite Garcia and Mangasarian gj(x gjCx1 globally and superlinearly globally convergent exact go to step Hence the proof Hessian i+1 i+1 i+l i+l i+l implies Jacobian nonsingularity conditions jel(x Kuhn-Tucker conditions Kuhn-Tucker point Lagrangian lemma linear program Lipchitz continuous lltll2 mean value theorem Nonlinear Programming nonnegative open ball optimal solution PCv1 point of P(0,x point of problem positive real numbers quadratic program quasi-Newton iterates Quasi-Newton Method SIU MING CHUNG stationary point stepsize procedures sufficiently close superlinearly convergent algorithms thesis u)ll University of Wisconsin updating schemes vector Vf(x Vgj(x Vgj(x)Tt vVf(x w e T(x weT(x x e B(x xeRn