Related papers: A feasibility approach for constructing combinator…
We consider the problem of finding (in some sense) the best approximation control for an infeasible double integrator. The control function is constrained by upper and lower bounds that are too tight and thus cause infeasibility. The…
The control and sensing of large-scale systems results in combinatorial problems not only for sensor and actuator placement but also for scheduling or observability/controllability. Such combinatorial constraints in system design and…
We propose a new scheme to implement the self-consistent optimization of the trial wave-function in constrained path auxiliary field Quantum Monte Carlo (CP-AFQMC) in the framewok of natural orbitals. In this scheme, a new trial…
One of the keys to flying quadrotors is to optimize their trajectories within the set of collision-free corridors. These corridors impose nonconvex constraints on the trajectories, making real-time trajectory optimization challenging. We…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
For fixed weights w_1,...,w_n, and for d>0, we let B denote a collection of d*n balls, with d balls of weight w_i for each i=1,...,n. We consider the problem of assigning the balls to n bins with capacities C_1,...,C_n, in such a way that…
We construct supplementary difference sets (SDS) with parameters $(59;28,22;21)$, $(69;31,27;24)$, $(75;36,29;28)$, $(77;34,31;27)$ and $(87;38,36;31)$. These SDSs give D-optimal designs (DO-designs) of two-circulant type of orders…
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…
The circulant real and complex matrices are used to find new real and complex conference matrices. With them we construct Sylvester inverse orthogonal matrices by doubling the size of inverse complex conference matrices. When the free…
In this expository paper, we show how to use the Douglas-Rachford algorithm as a successful heuristic for finding magic squares. The Douglas-Rachford algorithm is an iterative projection method for solving feasibility problems. Although its…
We present a scalable combinatorial algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We use the mathematically elegant formalism proposed by Windheuser et al. (ICCV 2011) where 3D…
In this paper, we develop new fast and efficient algorithms for designing single/multiple unimodular waveforms/codes with good auto- and cross-correlation or weighted correlation properties, which are highly desired in radar and…
Shaping the reachable set of a dynamical system is a fundamental challenge in control design, with direct implications for both performance and safety. This paper considers the problem of selecting the optimal input matrix for a linear…
The vehicle routing problem is a well known class of NP-hard combinatorial optimisation problems in literature. Traditional solution methods involve either carefully designed heuristics, or time-consuming metaheuristics. Recent work in…
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…
The paper outlines novel variational technique for finding microstructures of optimal multimaterial composites, bounds of composites properties, and multimaterial optimal designs. The translation method that is used for the exact…
The Douglas-Rachford (DR) method is a widely used method for finding a point in the intersection of two closed convex sets (feasibility problem). However, the method converges weakly and the associated rate of convergence is hard to analyze…
The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with respect to convex sets. Since reflections are based on…