Lipschitz continuous policy functions for strongly concave optimization problems
نویسندگان
چکیده
منابع مشابه
Team optimization problems with Lipschitz continuous strategies
Sufficient conditions for the existence and Lipschitz continuity of optimal strategies for static team optimization problems are studied. Revised statements and proofs of some results appeared in the literature are presented. Their extensions are discussed. As an example of application, optimal production in a multidivisional firm is considered.
متن کاملIterative algorithm for strongly continuous semigroup of Lipschitz pseudocontraction mappings
In this paper, an implicit iterative process is considered for strongly continuous semigroup of Lipschitz pseudocontraction mappings. Weak and strong convergence theorems for common fixed points of strongly continuous semigroup of Lipschitz pseudocontraction mappings are established in a real Banach space. c ©2016 All rights reserved.
متن کاملGlobal optimization of Lipschitz functions
The goal of the paper is to design sequential strategies which lead to efficient optimization of an unknown function under the only assumption that it has a finite Lipschitz constant. We first identify sufficient conditions for the consistency of generic sequential algorithms and formulate the expected minimax rate for their performance. We introduce and analyze a first algorithm called LIPO wh...
متن کاملMASSACHUSETTS INSTITUTE OF TECHNOLOGY by Strongly Polynomial Primal - Dual Algorithms for Concave Cost Combinatorial Optimization Problems
We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixedcharge counterpart of the problem. For many practical concave cost problems, the fixed-charge counterpart is a well-studied combinatorial optim...
متن کاملMinimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
This paper is about theminimization of Lipschitz-continuous and strongly convex functions over integer points in polytopes. Our results are related to the rate of convergence of a black-box algorithm that iteratively solves special quadratic integer problems with a constant approximation factor. Despite the generality of the underlying problem, we prove that we can find efficiently, with respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 1987
ISSN: 0304-4068
DOI: 10.1016/0304-4068(87)90012-7