Broadband Active Noise Control Design through Nonsmooth H∞ Synthesis

Active control of road noise in car cabins has received much attention in recent years and it has been well known that local quiet zones can be created with headrest loudspeakers. The local control performance achieved with door loudspeakers is investigated in this manuscript based on the measurements in a car cabin, and it is compared with that achieved with two headrest speakers. The noise reduction performance at error microphones, the upper limit frequency of effective control, as well as the size of the quiet zone are investigated in detail. The difficulties and challenges of using the door loudspeakers for local control are discussed.

In this paper, new classes of nondifferentiable generalized invex functions are introduced. Further, nonsmooth vector optimization problems with functions belonging to the introduced classes of (generalized) (Φ,ρ)-type I functions are considered. Sufficient optimality conditions and duality results for such classes of nonsmooth vector optimization problems are established. It turns out that the presented results are proved also for such nonconvex vector optimization problems in which not all functions constituting them possess the fundamental property of invexity.

This paper proposes a new proximal iteratively reweighted nuclear norm method for a class of nonconvex and nonsmooth optimization problems. The primary contribution of this work is the incorporation of line search technique based on dimensionality reduction and extrapolation. This strategy overcomes parameter constraints by enabling adaptive dynamic adjustment of the extrapolation/proximal parameters (αk, βk, μk). Under the Kurdyka–Łojasiewicz framework for nonconvex and nonsmooth optimization, we prove the global convergence and linear convergence rate of the proposed algorithm. Additionally, through numerical experiments using synthetic and real data in matrix completion problems, we validate the superior performance of the proposed method over well-known methods.

Active road noise control (ARNC) is an effective method for mitigating low-frequency noise in vehicle cabins. Previous work introduced a decoupling-whitening frequency domain filtered-error least mean square (DWFDFeLMS) algorithm, which exhibits rapid convergence characteristics for steady-state environments. However, uncorrelated disturbances significantly impact the convergence performance and stability of adaptive algorithms in practical applications. In this paper, a coherence-based robust frequency-dependent variable step size method is proposed to dynamically adjust the step size, using the multichannel coherence coefficients between reference signals and error signals for system stability. Additionally, it is combined with the DWFDFeLMS algorithm for fast convergence speed in ARNC systems. The proposed algorithm ensures fast initial convergence, small steady-state error, and resilience to in-cabin interference. The superiority of this algorithm in terms of convergence speed and stability is confirmed through simulations with measured road noise data and in a real-time ANC system in a car cabin.

In this work, we introduce a novel stochastic proximal alternating linearized minimization algorithm [J. Bolte, S. Sabach, and M. Teboulle, Math. Program., 146 (2014), pp. 459--494] for solving a class of nonsmooth and nonconvex optimization problems. Large-scale imaging problems are becoming increasingly prevalent due to the advances in data acquisition and computational capabilities. Motivated by the success of stochastic optimization methods, we propose a stochastic variant of proximal alternating linearized minimization. We provide global convergence guarantees, demonstrating that our proposed method with variance-reduced stochastic gradient estimators, such as SAGA [A. Defazio, F. Bach, and S. Lacoste-Julien, Advances in Neural Information Processing Systems, 2014, pp. 1646--1654] and SARAH [L. M. Nguyen, J. Liu, K. Scheinberg, and M. Takáĉ, Proceedings of the 34th International Conference on Machine Learning, PMLR 70, 2017, pp. 2613--2621], achieves state-of-the-art oracle complexities. We also demonstrate the efficacy of our algorithm via several numerical examples including sparse nonnegative matrix factorization, sparse principal component analysis, and blind image-deconvolution.

In this paper, we consider a class of nonsmooth and nonconvex optimization problems over the Stiefel manifold where the objective function is the summation of a nonconvex smooth function and a nonsmooth Lipschitz continuous convex function composed with a linear mapping. Besides, we are interested in its application to the graph Fourier basis problem. We propose three numerical algorithms for solving this problem, by combining smoothing methods and some existing algorithms for smooth optimization over the Stiefel manifold. In particular, we approximate the aforementioned nonsmooth convex function by its Moreau envelope in our smoothing methods, and prove that the Moreau envelope has many favorable properties. Thanks to this and the scheme for updating the smoothing parameter, we show that any accumulation point of the solution sequence generated by the proposed algorithms is a stationary point of the original optimization problem. Numerical experiments on building graph Fourier basis are conducted to demonstrate the efficiency of the proposed algorithms.

In this paper, we combine the positive aspects of the gradient sampling (GS) and bundle methods, as the most efficient methods in nonsmooth optimization, to develop a robust method for solving unconstrained nonsmooth convex optimization problems. The main aim of the proposed method is to take advantage of both GS and bundle methods, meanwhile avoiding their drawbacks. At each iteration of this method, to find an efficient descent direction, the GS technique is utilized for constructing a local polyhedral model for the objective function. If necessary, via an iterative improvement process, this initial polyhedral model is improved by some techniques inspired by the bundle and GS methods. The convergence of the method is studied, which reveals that the global convergence property of our method is independent of the number of gradient evaluations required to establish and improve the initial polyhedral models. Thus, the presented method needs much fewer gradient evaluations in comparison to the original GS method. Furthermore, by means of numerical simulations, we show that the presented method provides promising results in comparison with GS methods, especially for large scale problems. Moreover, in contrast with some bundle methods, our method is not very sensitive to the accuracy of supplied gradients.

Global active noise control (ANC) systems reduce noise over the entire car cabin with robust performance even as the human head moves; however, they have not been implemented in real-world applications. A robust error sensing strategy is proposed in this paper that is based on which a feasible global ANC system is realized in an electric car, and real-time ANC experiments demonstrate its effectiveness. Simulations based on measured road noise show that using evenly distributed error sensors is a robust error sensing strategy for different car speeds and the upper limit frequency of 3 dB global control is inversely proportional to the equivalent distance between error sensors. Real-time experiments with a 5-seat A-class sedan demonstrate that an average noise reduction of 3.8 dB was achieved between 50 and 250 Hz with 12 evenly distributed error sensors using the four standard car audio loudspeakers as secondary sources. Virtual sensing techniques can be integrated to constitute a more practical system without obstructing the movement of human heads. The findings in this study establish a benchmark for global noise control in car cabins and can be a starting point for future optimization of the system and implementation of adaptive algorithms.

In this paper, a one-layer recurrent neural network is proposed for solving non-smooth convex optimization problems with linear equality constraints. Comparing with the existing neural networks, the proposed neural network has simpler architecture and the number of neurons is the same as that of decision variables in the optimization problems. The global convergence of the neural network can be guaranteed if the non-smooth objective function is convex. Simulation results are provided to show that the state trajectories of the neural network can converge to the optimal solutions of the non-smooth convex optimization problems and show the performance of the proposed neural network.KeywordsNeural NetworkIEEE TransactionGlobal ConvergenceRecurrent Neural NetworkState TrajectoryThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

The existing machine learning algorithms for minimizing the convex function over a closed convex set suffer from slow convergence because their learning rates must be determined before running them. This paper proposes two machine learning algorithms incorporating the line search method, which automatically and algorithmically finds appropriate learning rates at run-time. One algorithm is based on the incremental subgradient algorithm, which sequentially and cyclically uses each of the parts of the objective function; the other is based on the parallel subgradient algorithm, which uses parts independently in parallel. These algorithms can be applied to constrained nonsmooth convex optimization problems appearing in tasks of learning support vector machines without adjusting the learning rates precisely. The proposed line search method can determine learning rates to satisfy weaker conditions than the ones used in the existing machine learning algorithms. This implies that the two algorithms are generalizations of the existing incremental and parallel subgradient algorithms for solving constrained nonsmooth convex optimization problems. We show that they generate sequences that converge to a solution of the constrained nonsmooth convex optimization problem under certain conditions. The main contribution of this paper is the provision of three kinds of experiment showing that the two algorithms can solve concrete experimental problems faster than the existing algorithms. First, we show that the proposed algorithms have performance advantages over the existing ones in solving a test problem. Second, we compare the proposed algorithms with a different algorithm Pegasos, which is designed to learn with a support vector machine efficiently, in terms of prediction accuracy, value of the objective function, and computational time. Finally, we use one of our algorithms to train a multilayer neural network and discuss its applicability to deep learning.

Phase retrieval with prior information can be cast as a nonsmooth and nonconvex optimization problem. To decouple the signal and measurement variables, we introduce an auxiliary variable and reformulate it as an optimization with an equality constraint. We then solve the reformulated problem by graph projection splitting (GPS), where the two proximity subproblems and the graph projection step can be solved efficiently. With slight modification, we also propose a robust graph projection splitting (RGPS) method to stabilize the iteration for noisy measurements. Contrary to intuition, RGPS outperforms GPS with fewer iterations to locate a satisfying solution even for noiseless case. Based on the connection between GPS and Douglas–Rachford iteration, under mild conditions on the sampling vectors, we analyze the fixed point sets and provide the local convergence of GPS and RGPS applied to noiseless phase retrieval without prior information. For noisy case, we provide the error bound of the reconstruction. Compared to other existing methods, thanks for the splitting approach, GPS and RGPS can efficiently solve phase retrieval with prior information regularization for general sampling vectors which are not necessarily isometric. For Gaussian phase retrieval, compared to existing gradient flow approaches, numerical results show that GPS and RGPS are much less sensitive to the initialization. Thus they markedly improve the phase transition in noiseless case and reconstruction in the presence of noise respectively. GPS shows sharpest phase transition among existing methods including RGPS, while it needs more iterations than RGPS when the number of measurement is large enough. RGPS outperforms GPS in terms of stability for noisy measurements. When applying RGPS to more general non-Gaussian measurements with prior information, such as support, sparsity and TV minimization, RGPS either outperforms state-of-the-art solvers or can be combined with state-of-the-art solvers to improve their reconstruction quality.

Multidimensional scaling (MDS) is a popular tool for dimensionality reduction and data visualization. Given distances between data points and a target low-dimension, the MDS problem seeks to find a configuration of these points in the low-dimensional space, such that the inter-point distances are preserved as well as possible. We focus on the most common approach to formulate the MDS problem, known as stress minimization, which results in a challenging non-smooth and non-convex optimization problem. In this paper, we propose an inertial version of the well-known SMACOF Algorithm, which we call AI-SMACOF. This algorithm is proven to be globally convergent, and to the best of our knowledge this is the first result of this kind for algorithms aiming at solving the stress MDS minimization. In addition to the theoretical findings, numerical experiments provide another evidence for the superiority of the proposed algorithm.

This document describes new advances in hybrid reachability techniques accomplished during the course of a one-year Truman Postdoctoral Fellowship. These techniques provide guarantees of safety in complex systems, which is especially important in high-risk, expensive, or safety-critical systems. My work focused on new approaches to two specific problems motivated by real-world issues in complex systems: (1) multi-objective controller synthesis, and (2) control for recovery from error. Regarding the first problem, a novel application of reachability analysis allowed controller synthesis in a single step to achieve (a) safety, (b) stability, and (c) prevent input saturation. By extending the state to include the input parameters, constraints for stability, saturation, and envelope protection are incorporated into a single reachability analysis. Regarding the second problem, a new approach to the problem of recovery provides (a) states from which recovery is possible, and (b) controllers to guide the system during a recovery maneuver from an error state to a safe state in minimal time. Results are computed in both problems on nonlinear models of single longitudinal aircraft dynamics and two-aircraft lateral collision avoidance dynamics.

This paper presents a nonmonotone scaled memoryless BFGS preconditioned conjugate gradient algorithm for solving nonsmooth convex optimization problems, which combines the idea of scaled memoryless BFGS preconditioned conjugate gradient method with the nonmonotone technique and the Moreau-Yosida regularization. The proposed method makes use of approximate function and gradient values of the Moreau-Yosida regularization instead of the corresponding exact values. Under mild conditions, the global convergence of the proposed method is established. Preliminary numerical results and related comparisons show that the proposed method can be applied to solve large scale nonsmooth convex optimization problems.

In this paper we introduce qualification conditions for multivalued functions in Banach spaces involving the A-approximate subdifferential, and we show that these conditions guarantee metric regularity of multivalued functions. The results are then applied for deriving Lagrange multipliers of Fritz—John type and Kuhn—Tucker type for infinite non-smooth vector optimization problems.