Discrete Convex Analysis

Front Cover
SIAM, Jan 1, 2003 - Mathematics - 411 pages
Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis. Discrete Convex Analysis provides the information that professionals in optimization will need to "catch up" with this new theoretical development. It also presents an unexpected connection between matroid theory and mathematical economics and expounds a deeper connection between matrices and matroids than most standard textbooks.
 

Contents

DT10ch1
1
DT10ch2
39
DT10ch3
77
DT10ch4
101
DT10ch5
121
DT10ch6
133
DT10ch7
177
DT10ch8
205
DT10ch9
245
DT10ch10
281
DT10ch11
323
DT10ch12
347
DT10bm
363
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information