... On basic operations related to network induction of discrete convex functions. Optim. Methods Softw. 36(2–3), 519–559 (2021) 21. Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58–73 (1981) 22. Nikolova, E.: Approximation ...

Kazuo Murota. [ 184 ] L. S. Shapley : On network flow functions , Naval Research Logistics Quarterly , 8 ( 1961 ) ... induction of M - convex functions through networks , Research Reports on Mathematical and Computing Sci- ences , B ...

This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines.

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency.

Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and practical applications.

Since then it has been used as the primary text for this course at UNC, as well as at other institutions."--Open Textbook Library

... functions and convex functions . His efforts are directed toward extension of volterra opera- tors to other than LP ... discrete symbols . Results are expected to be applicable to the extrapolation of unordered sets of objects ...

The book may be used as a text for a theoretical convex optimization course; the author has taught several variants of such a course at MIT and elsewhere over the last ten years.

This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization.

An integrated package of powerful probabilistic tools and key applications in modern mathematical data science.