## Finite Dimensional Convexity and OptimizationThis book discusses convex analysis, the basic underlying structure of argumentation in economic theory. Convex analysis is also common to the optimization of problems encountered in many applications. The text is aimed at senior undergraduate students, graduate students, and specialists of mathematical programming who are undertaking research into applied mathematics and economics. The text consists of a systematic development in eight chapters, and contains exercises. The book is appropriate as a class text or for self-study. |

### What people are saying - Write a review

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

### Contents

II | 1 |

III | 2 |

IV | 4 |

V | 5 |

VI | 6 |

VII | 7 |

VIII | 8 |

X | 11 |

XXXIV | 67 |

XXXVI | 73 |

XXXVIII | 76 |

XXXIX | 79 |

XL | 81 |

XLI | 87 |

XLII | 88 |

XLIII | 89 |

XI | 14 |

XII | 15 |

XIII | 21 |

XIV | 22 |

XV | 24 |

XVI | 28 |

XVII | 29 |

XVIII | 32 |

XIX | 33 |

XX | 37 |

XXI | 38 |

XXII | 40 |

XXIII | 45 |

XXIV | 47 |

XXV | 51 |

XXVI | 52 |

XXVII | 53 |

XXVIII | 54 |

XXIX | 56 |

XXX | 59 |

XXXI | 60 |

XXXII | 61 |

XXXIII | 62 |

### Other editions - View all

Finite Dimensional Convexity and Optimization Monique Florenzano,Cuong Le Van No preview available - 2011 |

Finite Dimensional Convexity and Optimization Monique Florenzano,Cuong Le Van No preview available - 2012 |

### Common terms and phrases

aff(dom affine hull affine set affinely independent Ai)ie Assume asymptotic cone closed half-spaces compact subset constraints converges convex cone convex function convex hull convex set convex subset Corollary denotes Exercise exists extreme point f is continuous f is convex feasible set fi(x finite function f function from Rn function on Rn G i(dom Hence implies intersection Kuhn-Tucker Conditions Lemma Let f lev<Q level set linear functional linear inequalities linear programming linear programming problem linear subspace Minimize Nc(x necessary and sufficient non-decreasing o/Rn open ball open set optimal solution polyhedral convex set previous proposition Proof prove real numbers relative interior resp ri(C Separation theorem sequence set of Rn Slater Condition subdifferential sublinear function subset of Rn subspace of Rn supporting hyperplane vector verify Vx G Rn Vy G x G Rn