Descripción del título
Discrete convex analysis / ...
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
Monografía
monografia Rebiun37145548 https://catalogo.rebiun.org/rebiun/record/Rebiun37145548 m eo d cr bn |||m|||a 101020s2003 paua ob 001 0 eng d 2003042468 0-89871-850-3 DT10 siam DT10 SIAM CUNEF 991000509049608131 CaBNVSL. CaBNVSL. CaBNVSL eng 515/.8 21 Murota, Kazuo 1955-) Discrete convex analysis Kazuo Murota Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 2003 Philadelphia, Pa. Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1 electronic text (xxii, 389 p. : ill.) digital file 1 electronic text (xxii, 389 p. : ill.) Text txt computer c online resource cr SIAM monographs on discrete mathematics and applications Bibliographic Level Mode of Issuance: Monograph Includes bibliographical references (p. 363-377) and index Introduction to the Central Concepts -- Convex Functions with Combinatorial Structures -- Convex Analysis, Linear Programming, and Integrality -- M-Convex Sets and Submodular Set Functions -- L-Convex Sets and Distance Functions -- M-Convex Functions -- L-Convex Functions -- Conjugacy and Duality -- Network Flows -- Algorithms -- Application to Mathematical Economics -- Application to Systems Analysis by Mixed Matrices 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 Also available in print version Mode of access: World Wide Web System requirements: Adobe Acrobat Reader English Convex functions Convex sets Mathematical analysis Society for Industrial and Applied Mathematics 0-89871-540-7 SIAM monographs on discrete mathematics and applications