## An Algorithmic Approach to Nonlinear Analysis and OptimizationAn Algorithmic Approach to Nonlinear Analysis and Optimization |

### What people are saying - Write a review

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

### Contents

1 | |

Chapter 2 Constrained Optimization on En | 67 |

Chapter 3 Computational Techniques for Constrained Optimization on En | 110 |

Chapter 4 Constrained Optimization in Function Space | 159 |

Chapter 5 Weak Convergence in Hilbert Space | 185 |

Computer Program for the Solution of TwoPoint Boundary Value Problems | 204 |

229 | |

AUTHOR INDEX | 231 |

233 | |

236 | |

### Other editions - View all

An Algorithmic Approach to Nonlinear Analysis and Optimization Edward J. Beltrami No preview available - 1970 |

### Common terms and phrases

algorithm approximation assume ball boundary value problems bounded C1 function Chapter closed columns compact conjugate constant constrained minimum constraint set continuous contraction mapping convergence convex functionals convex set deﬁned denoted descent method directional derivative discussed domain of attraction eigenvalues equality constraints Euclidean example Exercise exists fact ﬁnal ﬁnd ﬁnding ﬁnite ﬁrst ﬁxed point follows function f function space given gradient projection Hence Hessian Hilbert space ill conditioning inequality constraints integration interval inverse Lagrange multiplier Lemma Let f mapping matrix maximal rank Moreover multiplier rule Newton’s method non-Euclidean norm nonlinear normed linear space null space numerical objective function obtain open set optimization orthogonal penalty argument positive deﬁnite positive-deﬁnite proof quadratic function rank G result satisﬁes scalar Section semicontinuous sequence shows solution solve steepest descent suitable suppose Theorem two-point boundary value unconstrained unique vector Vf(u Vf(x weak convergence weakly zero