Linearly embeddable designs

We address the problem of determining when a plane algebraic cubic curve is complete as an (n, 3)-arc in \(\mathrm {PG}(2,q)\). Theoretical results are given for absolutely irreducible singular cubic curves, while computer based results are given for \(q\le 81\).     

Classification of partial difference sets in Abelian groups of order $$4p^2$$

In this article we provide a complete classification of regular partial difference sets in Abelian groups of order \(4p^2\), p an odd prime. It turns out that the known examples are the only examples. These are, up to complements, the trivial examples, the PCP examples, and a sporadic example in \(\mathbb {Z}_2^2\times \mathbb {Z}_3^2\).     

Characterizing Gaussian Flows Arising from Itô’s Stochastic Differential Equations

In order to identify which of the strong solutions of Itô’s stochastic differential equations (SDEs) are Gaussian, we introduce a class of diffusions which ‘depend deterministically on the initial condition’ and then characterize the class. This characterization allows us to show, using the Monotonicity inequality, that the transpose of the flows generated by the SDEs, for an extended class of initial conditions, are the unique solutions of the class of stochastic partial differential equations introduced in Rajeev and Thangavelu (Potential Anal. 28(2), 139–162 2008), ‘Probabilistic Representations of Solutions of the Forward Equations’.     

A Notion of Fine Continuity for BV Functions on Metric Spaces

In the setting of a metric space equipped with a doubling measure supporting a Poincaré inequality, we show that BV functions are, in the sense of multiple limits, continuous with respect to a 1-fine topology, at almost every point with respect to the codimension 1 Hausdorff measure.     

In Metric-measure Spaces Sobolev Embedding is Equivalent to a Lower Bound for the Measure

We study Sobolev inequalities on doubling metric measure spaces. We investigate the relation between Sobolev embeddings and lower bound for measure. In particular, we prove that if the Sobolev inequality holds, then the measure μ satisfies the lower bound, i.e. there exists b such that μ(B(x,r))≥b r ^α for r∈(0,1] and any point x from metric space.     

Fast algorithm for singly linearly constrained quadratic programs with box-like constraints

This paper focuses on a singly linearly constrained class of convex quadratic programs with box-like constraints. We propose a new fast algorithm based on parametric approach and secant approximation method to solve this class of quadratic problems. We design efficient implementations for our proposed algorithm and compare its performance with two state-of-the-art standard solvers called Gurobi and Mosek. Numerical results on a variety of test problems demonstrate that our algorithm is able to efficiently solve the large-scale problems with the dimension up to fifty million and it substantially outperforms Gurobi and Mosek in terms of the running time.     

Optimal transport and a bilevel location-allocation problem

In this paper a two-stage optimization model is studied to find the optimal location of new facilities and the optimal partition of the consumers (location-allocation problem). The social planner minimizes the social costs, i.e. the fixed costs plus the waiting time costs, taking into account that the citizens are partitioned in the region according to minimizing the capacity costs plus the distribution costs in the service regions. By using optimal transport tools, existence results of solutions to the location-allocation problem are presented together with some examples.     

Dynamic algorithm selection for pareto optimal set approximation

This paper presents a meta-algorithm for approximating the Pareto optimal set of costly black-box multiobjective optimization problems given a limited number of objective function evaluations. The key idea is to switch among different algorithms during the optimization search based on the predicted performance of each algorithm at the time. Algorithm performance is modeled using a machine learning technique based on the available information. The predicted best algorithm is then selected to run for a limited number of evaluations. The proposed approach is tested on several benchmark problems and the results are compared against those obtained using any one of the candidate algorithms alone.     

On parallel Branch and Bound frameworks for Global Optimization

Branch and Bound (B&B) algorithms are known to exhibit an irregularity of the search tree. Therefore, developing a parallel approach for this kind of algorithms is a challenge. The efficiency of a B&B algorithm depends on the chosen Branching, Bounding, Selection, Rejection, and Termination rules. The question we investigate is how the chosen platform consisting of programming language, used libraries, or skeletons influences programming effort and algorithm performance. Selection rule and data management structures are usually hidden to programmers for frameworks with a high level of abstraction, as well as the load balancing strategy, when the algorithm is run in parallel. We investigate the question by implementing a multidimensional Global Optimization B&B algorithm with the help of three frameworks with a different level of abstraction (from more to less): Bobpp, Threading Building Blocks (TBB), and a customized Pthread implementation. The following has been found. The Bobpp implementation is easy to code, but exhibits the poorest scalability. On the contrast, the TBB and Pthread implementations scale almost linearly on the used platform. The TBB approach shows a slightly better productivity.     

On the number of derangements and derangements of prime power order of the affine general linear groups

A derangement is a permutation that has no fixed points. In this paper, we are interested in the proportion of derangements of the finite affine general linear groups. We prove a remarkably simple and explicit formula for this proportion. We also give a formula for the proportion of derangements of prime power order. Both formulae rely on a result of independent interest on partitions: we determine the generating function for the partitions with m parts and with the kth largest part not k, for every \(k\in \mathbb {N}\).