## Optimization: Theory and PracticeOptimization: Theory and Practice is ideally suited for a first course on optimization. It gives a detailed mathematical exposition to various optimization techniques. The presentation style retains abstract flavor of the mathematical framework as well as applicability potential of techniques, thereby making the text useful to both scientists and engineers. |

### What people are saying - Write a review

User Review - Flag as inappropriate

Algorithm 2.3.1 on p. 77 has several bugs. I had to correct the decision block and the convergence test to get it to work correctly. If contacted, I can email the corrections to the authors.

### Contents

Mathematical Preliminaries | 1 |

OneDimensional Optimization | 49 |

Unconstrained Gradient Based Optimization Methods | 95 |

Linear Programming | 174 |

Constrained Optimization Methods | 238 |

Evolutionary Algorithms | 300 |

### Common terms and phrases

Algorithm applied approximation assume basic variable becomes called choose column component compute condition Consider constraints continuous convergence of iterates convex corresponding cost critical point defined denoted differentiable direction discussed dual Eason and Fenton equal equation evaluations Example exists fact feasible solution Figure flow given by Eq gives global minimizer gradient hence implies inequality Initial guess interpolation interval length linear Marquardt's method matrix maximizer maximum method convergence minimizer of f negative Newton's method nonbasic Note objective function obtained optimal optimal solution positive definite presented problem problem given procedure Programming Proof quadratic function queue reduced refer repeat respectively result satisfy simplex method solution Solve space steepest descent step Study symmetric matrix Table Theorem unit values vector zero