Author: Kazuo Murota
Publisher: SIAM
ISBN: 0898715407
Category : Mathematics
Languages : en
Pages : 406
Book Description
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.
Discrete Convex Analysis
Author: Kazuo Murota
Publisher: SIAM
ISBN: 0898715407
Category : Mathematics
Languages : en
Pages : 406
Book Description
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.
Publisher: SIAM
ISBN: 0898715407
Category : Mathematics
Languages : en
Pages : 406
Book Description
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.
Discrete Mathematics and Applications
Author: Andrei M. Raigorodskii
Publisher: Springer Nature
ISBN: 3030558576
Category : Mathematics
Languages : en
Pages : 499
Book Description
Advances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.
Publisher: Springer Nature
ISBN: 3030558576
Category : Mathematics
Languages : en
Pages : 499
Book Description
Advances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.
Discrete Convex Analysis
Author: Kazuo Murota
Publisher:
ISBN:
Category : Combinatorial optimization
Languages : en
Pages : 27
Book Description
Abstract: "This is a survey of the theory of 'discrete convex analysis' that has been developed recently by the author for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, subgradients, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid- theoretic concepts, in particular, submodular functions and exchange axioms. The results extend the relationship investigated in the eighties between convex functions and submodular functions. This paper puts stress on conjugacy and duality for discrete convex functions."
Publisher:
ISBN:
Category : Combinatorial optimization
Languages : en
Pages : 27
Book Description
Abstract: "This is a survey of the theory of 'discrete convex analysis' that has been developed recently by the author for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, subgradients, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid- theoretic concepts, in particular, submodular functions and exchange axioms. The results extend the relationship investigated in the eighties between convex functions and submodular functions. This paper puts stress on conjugacy and duality for discrete convex functions."
Discrete Convex Analysis
Author: Kazuo Murota
Publisher: SIAM
ISBN: 9780898718508
Category : Mathematics
Languages : en
Pages : 411
Book Description
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.
Publisher: SIAM
ISBN: 9780898718508
Category : Mathematics
Languages : en
Pages : 411
Book Description
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.
Convex and Discrete Geometry
Author: Peter M. Gruber
Publisher: Springer Science & Business Media
ISBN: 3540711333
Category : Mathematics
Languages : en
Pages : 590
Book Description
Convex and Discrete Geometry is an area of mathematics situated between analysis, geometry and discrete mathematics with numerous relations to other subdisciplines. This book provides a comprehensive overview of major results, methods and ideas of convex and discrete geometry and its applications. Besides being a graduate-level introduction to the field, it is a practical source of information and orientation for convex geometers, and useful to people working in the applied fields.
Publisher: Springer Science & Business Media
ISBN: 3540711333
Category : Mathematics
Languages : en
Pages : 590
Book Description
Convex and Discrete Geometry is an area of mathematics situated between analysis, geometry and discrete mathematics with numerous relations to other subdisciplines. This book provides a comprehensive overview of major results, methods and ideas of convex and discrete geometry and its applications. Besides being a graduate-level introduction to the field, it is a practical source of information and orientation for convex geometers, and useful to people working in the applied fields.
Convex Analysis and Variational Problems
Author: Ivar Ekeland
Publisher: SIAM
ISBN: 9781611971088
Category : Mathematics
Languages : en
Pages : 414
Book Description
This book contains different developments of infinite dimensional convex programming in the context of convex analysis, including duality, minmax and Lagrangians, and convexification of nonconvex optimization problems in the calculus of variations (infinite dimension). It also includes the theory of convex duality applied to partial differential equations; no other reference presents this in a systematic way. The minmax theorems contained in this book have many useful applications, in particular the robust control of partial differential equations in finite time horizon. First published in English in 1976, this SIAM Classics in Applied Mathematics edition contains the original text along with a new preface and some additional references.
Publisher: SIAM
ISBN: 9781611971088
Category : Mathematics
Languages : en
Pages : 414
Book Description
This book contains different developments of infinite dimensional convex programming in the context of convex analysis, including duality, minmax and Lagrangians, and convexification of nonconvex optimization problems in the calculus of variations (infinite dimension). It also includes the theory of convex duality applied to partial differential equations; no other reference presents this in a systematic way. The minmax theorems contained in this book have many useful applications, in particular the robust control of partial differential equations in finite time horizon. First published in English in 1976, this SIAM Classics in Applied Mathematics edition contains the original text along with a new preface and some additional references.
Algorithms for Convex Optimization
Author: Nisheeth K. Vishnoi
Publisher: Cambridge University Press
ISBN: 1108633994
Category : Computers
Languages : en
Pages : 314
Book Description
In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.
Publisher: Cambridge University Press
ISBN: 1108633994
Category : Computers
Languages : en
Pages : 314
Book Description
In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.
Recent Developments in Discrete Convex Analysis
Discrete Convex Analysis and Its Applications in Operations
Author: Xin Chen
Publisher:
ISBN:
Category :
Languages : en
Pages : 48
Book Description
Discrete convexity, in particular, L-natural-convexity and M-natural-convexity, provides a critical opening to attack several classical problems in inventory theory, as well as many other operations problems that arise from more recent practices, for instance, appointment scheduling and bike-sharing. As a powerful framework, discrete convex analysis is becoming increasingly popular in the literature. This review will survey the landscape of the approach. We start by introducing several key concepts, namely, L-natural-convexity and M-natural-convexity and their variants, followed by a discussion of some fundamental properties that are most useful for studying operations models. We then illustrate various applications of these concepts and properties. Examples include network flow problem, stochastic inventory control, appointment scheduling, game theory, portfolio contract, discrete choice model, and bike-sharing. We focus our discussion on demonstrating how discrete convex analysis can shed new insights on existing problems, and/or bring about much simpler analyses and algorithm developments than previous methods in the literature. We also present several results and analyses that are new to the literature.
Publisher:
ISBN:
Category :
Languages : en
Pages : 48
Book Description
Discrete convexity, in particular, L-natural-convexity and M-natural-convexity, provides a critical opening to attack several classical problems in inventory theory, as well as many other operations problems that arise from more recent practices, for instance, appointment scheduling and bike-sharing. As a powerful framework, discrete convex analysis is becoming increasingly popular in the literature. This review will survey the landscape of the approach. We start by introducing several key concepts, namely, L-natural-convexity and M-natural-convexity and their variants, followed by a discussion of some fundamental properties that are most useful for studying operations models. We then illustrate various applications of these concepts and properties. Examples include network flow problem, stochastic inventory control, appointment scheduling, game theory, portfolio contract, discrete choice model, and bike-sharing. We focus our discussion on demonstrating how discrete convex analysis can shed new insights on existing problems, and/or bring about much simpler analyses and algorithm developments than previous methods in the literature. We also present several results and analyses that are new to the literature.
Submodular Functions and Optimization
Author: Satoru Fujishige
Publisher: Elsevier
ISBN: 008046162X
Category : Mathematics
Languages : en
Pages : 411
Book Description
It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing further increasing importance in optimization, combinatorics, discrete mathematics, algorithmic computer science, and algorithmic economics, and there have been made remarkable developments of theory and algorithms in submodular functions. The 2nd edition of the book supplements the 1st edition with a lot of remarks and with new two chapters: "Submodular Function Minimization" and "Discrete Convex Analysis." The present 2nd edition is still a unique book on submodular functions, which is essential to students and researchers interested in combinatorial optimization, discrete mathematics, and discrete algorithms in the fields of mathematics, operations research, computer science, and economics. Self-contained exposition of the theory of submodular functions Selected up-to-date materials substantial to future developments Polyhedral description of Discrete Convex Analysis Full description of submodular function minimization algorithms Effective insertion of figures Useful in applied mathematics, operations research, computer science, and economics
Publisher: Elsevier
ISBN: 008046162X
Category : Mathematics
Languages : en
Pages : 411
Book Description
It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing further increasing importance in optimization, combinatorics, discrete mathematics, algorithmic computer science, and algorithmic economics, and there have been made remarkable developments of theory and algorithms in submodular functions. The 2nd edition of the book supplements the 1st edition with a lot of remarks and with new two chapters: "Submodular Function Minimization" and "Discrete Convex Analysis." The present 2nd edition is still a unique book on submodular functions, which is essential to students and researchers interested in combinatorial optimization, discrete mathematics, and discrete algorithms in the fields of mathematics, operations research, computer science, and economics. Self-contained exposition of the theory of submodular functions Selected up-to-date materials substantial to future developments Polyhedral description of Discrete Convex Analysis Full description of submodular function minimization algorithms Effective insertion of figures Useful in applied mathematics, operations research, computer science, and economics