Let $0 \lt p q\leq \infty $ and $\alpha \in (0,\infty ]$. We give a characterization of quasi-Banach interpolation spaces for the couple $(L_p(0,\alpha ),L_q(0,\alpha ))$ in terms two monotonicity properties, extending known results which mainly de

Supermassive black hole binaries (SMBHBs) produced in galaxy mergers are thought to complete their coalescence, at separations r ∼ < rGW ≈ 10 (MBH/10M⊙) pc, as their orbit decays due to the emission of gravitational waves (GWs). Here we propose that it may be possible to identify such GW–driven inspirals statistically in a deep electromagnetic (EM) survey for variable sources, before the Laser ...

We introduce the concept of weak k-majorization extending the classical notion of weak sub-majorization. For integers k and n with k n a vector x 2 R is weakly k-majorized by a vector q 2 R if the sum of the r largest components of x does not exceed the sum of the r largest components of q, for r = 1; : : : ; k. For a given q the set of vectors weakly k-majorized by q de nes a polyhedron P (q;k...

Consider a category of product variants distinguished by some attribute such as color or flavor. A retailer must construct an assortment for the category, i.e., select a subset variants to stock and determine purchase quantities for each offered variant. We analyze this problem using a multinomial logit model to describe the consumer choice process and a newsboy model to represent the retailer’...

The main result of this paper is the extension of the Schur-Horn Theorem to infinite sequences: For two nonincreasing nonsummable sequences ξ and η that converge to 0, there exists a positive compact operator A with eigenvalue list η and diagonal sequence ξ if and only if Pn j=1 ξj ≤ Pn j=1 ηj for every n if and only if ξ = Qη for some orthostochastic matrix Q. When ξ and η are summable, requir...

Extracting structured subgraphs inside large graphs – often known as the planted subgraph problem – is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant efforts have been directed towards the development of tractable procedures that succeed on specific families of problem instances. We propose a new computation...

We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which is general enough to include the existing MM methods. Besides the local majorization condition, we only require that the difference between the directional derivatives of the objective function and its surrogate function vanishes when the number of iterations approaches infinity, which is a very...