Related papers: Band Gap Optimization of Two-Dimensional Photonic …
We propose a new constrained optimization approach to hyperspectral (HS) image restoration. Most existing methods restore a desirable HS image by solving some optimization problem, which consists of a regularization term(s) and a…
We study the inhibition of pattern formation in nonlinear optical systems using intracavity photonic crystals. We consider mean field models for single and doubly degenerate optical parametric oscillators. Analytical expressions for the new…
We have performed a numerical solution for band structure of an Abrikosov vortex lattice in type-II superconductors forming a periodic array in two dimensions for applications of incorporating the photonic crystals concept into…
We propose a homogeneous primal-dual interior-point method to solve sum-of-squares optimization problems by combining non-symmetric conic optimization techniques and polynomial interpolation. The approach optimizes directly over the…
We investigate the multi-dimensional Super Resolution problem on closed semi-algebraic domains for various sampling schemes such as Fourier or moments. We present a new semidefinite programming (SDP) formulation of the 1 -minimization in…
We propose an optimisation method for the inverse structural design of self-assembly of anisotropic patchy particles. The anisotropic interaction can be expressed by the spherical harmonics of the surface pattern on a patchy particle, and…
Chordal and factor-width decomposition methods for semidefinite programming and polynomial optimization have recently enabled the analysis and control of large-scale linear systems and medium-scale nonlinear systems. Chordal decomposition…
Using computer simulations, we explore how thermal noise-induced randomness in a self-assembled photonic crystal affects its photonic band gaps (PBGs). We consider a two-dimensional photonic crystal comprised of a self-assembled array of…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
A new conception of the wavelength division multiplexing on the basis of the two-dimensional photonic crystal was developed. The photonic crystals band structures were investigated in details. The method for the synthesis of the two-channel…
Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and…
We propose a method to generate a real-energy flat band in a two-dimensional (2D) non-Hermitian Lieb lattice. The coincidence of the flat band eigenstate in both real and momentum spaces is essential for the proposed flat band, which is…
There is an increasing interest in quantum algorithms for optimization problems. Within convex optimization, interior-point methods and other recently proposed quantum algorithms are non-trivial to implement on noisy quantum devices. Here,…
Degeneracy is an omnipresent phenomenon in various physical systems, which has its roots in the preservation of geometrical symmetry. In electronic and photonic crystal systems, very often this degeneracy can be broken by virtue of strong…
In this paper we derive a moment relaxation for large-scale nonsmooth optimization problems with graphical structure and spherical constraints. In contrast to classical moment relaxations for global polynomial optimization that suffer from…
By using the non-dominated sorting-based genetic algorithm II, we study the topology optimization of the two-dimensional phoxonic crystals (PxCs) with simultaneously maximal and complete photonic and phononic bandgaps. Our results show that…
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we…
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…
The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the original problem with an implicit compact…
Photonic crystals enable fine control over light propagation at the nanoscale, and thus play a central role in the development of photonic and quantum technologies. Photonic band diagrams (BDs) are a key tool to investigate light…