32 research outputs found
A Constrained Adaptive Active Noise Control Filter Design Method Via Online Convex Optimization
In practical active noise control (ANC) applications, various types of constraints may need to be satisfied, e.g., robust stability, disturbance enhancement, and filter output power constraint. Some adaptive filters such as leaky LMS have been developed to apply required constraints indirectly. However, when multiple constraints are required simultaneously, satisfactory noise performance is difficult to achieve by tuning only one leaky factor. Another filter design approach that may achieve better noise control performance is to solve a constrained optimization problem. But the computational complexity of solving such a constrained optimization problem for ANC applications is usually too high even for offline design. Recently, a convex optimization reformulation is proposed which significantly reduces the required computational effort in solving constrained optimization problems for active noise control applications. In the current work, a constrained adaptive ANC filter design method is proposed. The previously proposed convex formulation is improved so that it can be implemented in real-time. The optimal filter coefficients are then redesigned continuously using online convex optimization when the environment is time-varying
Quantum states with a positive partial transpose are useful for metrology
We show that multipartite quantum states that have a positive partial
transpose with respect to all bipartitions of the particles can outperform
separable states in linear interferometers. We introduce a powerful iterative
method to find such states. We present some examples for multipartite states
and examine the scaling of the precision with the particle number. Some
bipartite examples are also shown that possess an entanglement very robust to
noise. We also discuss the relation of metrological usefulness to Bell
inequality violation. We find that quantum states that do not violate any Bell
inequality can outperform separable states metrologically. We present such
states with a positive partial transpose, as well as with a non-positive
positive partial transpose.Comment: 6 pages including two figures + three-page supplement including two
figures using revtex 4.1, with numerically obtained density matrices as text
files; v2: published version; v3: published version, typo in the 4x4 bound
entangled state is corrected (noticed by Peng Yin
Optimal Polynomial Filtering for Accelerating Distributed Consensus
In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature attack this problem by distributed linear iterative algorithms, with asymptotic convergence of the consensus solution. It is known that the rate of convergence depends on the second largest eigenvalue of the weight matrix. In this paper, we propose the use of polynomial filtering in order to accelerate the convergence rate. The main idea of the proposed methodology is to apply a polynomial filter that will shape the spectrum of the weight matrix by minimizing its second largest eigenvalue and therefore increase the convergence rate. We formulate the computation of the optimal polynomial as a semi- definite program (SDP) that can be efficiently and globally solved. We provide simulation results that demonstrate the validity and effectiveness of the proposed scheme in both fixed and dynamic network topologies
Robust Optimization Using Computer Experiments
During metamodel-based optimization three types of implicit errors are typically made.The first error is the simulation-model error, which is defined by the difference between reality and the computer model.The second error is the metamodel error, which is defined by the difference between the computer model and the metamodel.The third is the implementation error.This paper presents new ideas on how to cope with these errors during optimization, in such a way that the final solution is robust with respect to these errors.We apply the robust counterpart theory of Ben-Tal and Nemirovsky to the most frequently used metamodels: linear regression and Kriging models.The methods proposed are applied to the design of two parts of the TV tube.The simulationmodel errors receive little attention in the literature, while in practice these errors may have a significant impact due to propagation of such errors
Conic Optimization Theory: Convexification Techniques and Numerical Algorithms
Optimization is at the core of control theory and appears in several areas of
this field, such as optimal control, distributed control, system
identification, robust control, state estimation, model predictive control and
dynamic programming. The recent advances in various topics of modern
optimization have also been revamping the area of machine learning. Motivated
by the crucial role of optimization theory in the design, analysis, control and
operation of real-world systems, this tutorial paper offers a detailed overview
of some major advances in this area, namely conic optimization and its emerging
applications. First, we discuss the importance of conic optimization in
different areas. Then, we explain seminal results on the design of hierarchies
of convex relaxations for a wide range of nonconvex problems. Finally, we study
different numerical algorithms for large-scale conic optimization problems.Comment: 18 page