Maximization for Inner Products under Quasi-monotone Constraints
نویسندگان
چکیده
This paper studies optimization for inner products of real vectors assuming monotonicity properties for the entries in one of the vectors. Resulting inequalities have been useful recently in bounding reciprocals of power series with rapidly decaying coefficients and in proving that all symmetric Toeplitz matrices generated by monotone convex sequences have offdiagonal decay preserved through triangular decompositions. An example of an application of the theory to global optimization for inner products is also provided.
منابع مشابه
Constrained Maximization of Non-Monotone Submodular Functions
The problem of constrained submodular maximization has long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The case of nonmonotone submodular maximization is not as well understood: the first approximation algorithms even for unconstrainted maximization were given by Feige et al. [FMV07]. More recently, Lee et al. [LMNS09] ...
متن کاملAssessment of Final Value of Selected Agricultural Products under Water Economic Scenarios
T his research is an attempt to determine the agronomic plan, shadow price and final value with an emphasis on optimization of water use in five main agricultural regions of Kerman province (Kerman, Baft, Bardsir, Bam, and Jiroft) and five crops (wheat, barley, potato, onion, and tomato). Analysis was based on three scenarios: (i) current planting conditions, (ii) profit maximization...
متن کاملSubmodular Maximization over Sliding Windows
In this paper we study the extraction of representative elements in the data stream model in the form of submodular maximization. Different from the previous work on streaming submodular maximization, we are interested only in the recent data, and study the maximization problem over sliding windows. We provide a general reduction from the sliding window model to the standard streaming model, an...
متن کاملMaximizing Non-monotone Submodular Functions under Matroid and Knapsack Constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the firs...
متن کاملConstrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
Constrained submodular maximization problems have long been studied, most recently in the context of auctions and computational advertising, with near-optimal results known under a variety of constraints when the submodular function is monotone. The case of non-monotone submodular maximization is less well understood: the first approximation algorithms even for the unconstrained setting were gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006