Efficient Iterative Algorithm Research Articles

Shared Manifold Regularized Joint Feature Selection for Joint Classification and Regression in Alzheimer's Disease Diagnosis.

In Alzheimer's disease (AD) diagnosis, joint feature selection for predicting disease labels (classification) and estimating cognitive scores (regression) with neuroimaging data has received increasing attention. In this paper, we propose a model named Shared Manifold regularized Joint Feature Selection (SMJFS) that performs classification and regression in a unified framework for AD diagnosis. For classification, unlike the existing works that build least squares regression models which are insufficient in the ability of extracting discriminative information for classification, we design an objective function that integrates linear discriminant analysis and subspace sparsity regularization for acquiring an informative feature subset. Furthermore, the local data relationships are learned according to the samples' transformed distances to exploit the local data structure adaptively. For regression, in contrast to previous works that overlook the correlations among cognitive scores, we learn a latent score space to capture the correlations and employ the latent space to design a regression model with l2,1 -norm regularization, facilitating the feature selection in regression task. Moreover, the missing cognitive scores can be recovered in the latent space for increasing the number of available training samples. Meanwhile, to capture the correlations between the two tasks and describe the local relationships between samples, we construct an adaptive shared graph to guide the subspace learning in classification and the latent cognitive score learning in regression simultaneously. An efficient iterative optimization algorithm is proposed to solve the optimization problem. Extensive experiments on three datasets validate the discriminability of the features selected by SMJFS.

Joint Optimization of Mobility and Reliability-Guaranteed Air-to-Ground Communication for UAVs

Aerial unmanned vehicles (UAVs) play a significant role in improving the connectivity and coverage of terrestrial communication networks. However, UAV-assisted air-to-ground (A2G) data transmissions usually encounter several fundamental challenges, such as terminal mobility, random nature in channel fading and contention, resource constraints, and application-specific transmission requirements. To tackle these challenges, we formulate a bi-level optimization problem that jointly considers the control of the UAV mobility and transmission power and the scheduling of A2G data transmissions. The objective is to optimize energy consumption and maximize A2G transmission reliability. Particularly, we first theoretically characterize the A2G transmission reliability from a probabilistic perspective concerning the effects of channel fading, channel access contention, and application requirements. We then derive a closed-form expression for the optimal expected transmission reliability. Using the closed-form reliability, we transform the bi-level optimization into a mathematically-tractable optimal control problem and propose an efficient iterative algorithm to solve it. Simulation results show that our approach provides a comprehensive improvement in terms of both energy utilization and A2G transmission reliability, in particular, with a reduction of more than 12.1% in energy consumption and an increase of 7.53% in reliability on average, compared to several baselines.

Multiview Spectral Clustering Based on Consensus Neighbor Strategy.

Multiview spectral clustering, renowned for its spatial learning capability, has garnered significant attention in the data mining field. However, existing methods assume that the optimal consensus adjacency matrix is confined within the space spanned by each view's adjacency matrix. This constraint restricts the feasible domain of the algorithm and hinders the exploration of the optimal consensus adjacency matrix. To address this limitation, we propose a novel and convex strategy, termed the consensus neighbor strategy, for learning the optimal consensus adjacency matrix. This approach constructs the optimal consensus adjacency matrix by capturing the consensus local structure of each sample across all views, thereby expanding the search space and facilitating the discovery of the optimal consensus adjacency matrix. Furthermore, we introduce the concept of a correlation measuring matrix to prevent trivial solution. We develop an efficient iterative algorithm to solve the resulting optimization problem, benefitting from the convex nature of our model, which ensures convergence to a global optimum. Experimental results on 16 multiview datasets demonstrate that our proposed algorithm surpasses state-of-the-art methods in terms of its robust consensus representation learning capability. The code of this article is uploaded to https://github.com/PhdJiayiTang/Consensus-Neighbor-Strategy.git.

Group sparse representation and saturation-value total variation based color image denoising under multiplicative noise

<abstract><p>In this article, we propose a novel group-based sparse representation (GSR) model for restoring color images in the presence of multiplicative noise. This model consists of a convex data-fidelity term, and two regularizations including GSR and saturation-value-based total variation (SVTV). The data-fidelity term is suitable for handling heavy multiplicative noise. GSR enables the retention of textures and details while sufficiently removing noise in smooth regions without producing the staircase artifacts engendered by total variation-based models. Furthermore, we introduce a multi-color channel-based GSR that involves coupling between three color channels. This avoids the generation of color artifacts caused by decoupled color channel-based methods. SVTV further improves the visual quality of restored images by diminishing certain artifacts induced by patch-based methods. To solve the proposed nonconvex model and its subproblem, we exploit the alternating direction method of multipliers, which contributes to an efficient iterative algorithm. Numerical results demonstrate the outstanding performance of the proposed model compared to other existing models regarding visual aspect and image quality evaluation values.</p></abstract>

The algorithm for canonical forms of neural ideals

<abstract><p>To elucidate the combinatorial architecture of neural codes, the neural ideal $ J_C $, an algebraic object, was introduced. Represented in its canonical form, $ J_C $ provides a succinct characterization of the inherent receptive field architecture within the code. The polynomials in $ J_C $ are also instrumental in determining the relationships among the neurons' receptive fields. Consequently, the computation of the collection of canonical forms is pivotal. In this paper, based on the study of relations between pseudo-monomials, the authors present a computationally efficient iterative algorithm for the canonical forms of the neural ideal. Additionally, we introduce a new relationship among the neurons' receptive fields, which can be characterized by if-and-only-if statements, relating both to $ J_C $ and to a larger ideal of a code $ I(C) $.</p></abstract>

Efficient iterative algorithm for improving frequency sweep linearity of external cavity lasers

Efficient iterative algorithm for improving frequency sweep linearity of external cavity lasers

Noise and distortion suppression for industrial confocal microscopy

Industrial confocal microscopy is an optical imaging measurement technology used in the fields of material research, defect detection and industrial inspection. Noise will affect the quality of the image and thus affect its performance. We propose a denoising algorithm based on CNN minimisation in this paper. First, we give the object function of the algorithm and the adaptive calculation formula of the capped value. Then, by using the difference convex (DC) optimisation algorithm framework, the sub-gradient optimisation condition, and the feedback framework, we develop a simple and efficient adaptive-stop iterative optimisation algorithm to solve this model and provide the closed solution of the model at each iteration. The experimental results show that for industrial confocal images, our algorithm can not only effectively suppress noise, but also effectively avoid the distortion of denoised images. The signal-to-noise ratio of industrial confocal denoised images is increased by 1.93 times. In addition, experiments show that the algorithm has good noise reduction ability in other optical imaging instruments, and can suppress not only Gaussian noise, but also Gaussian-Poisson noise.

Joint AP‐user association and caching strategy for delivery delay minimization in cell‐free massive MIMO systems

AbstractEdge caching at access points (APs) is a promising approach to alleviate the fronthaul burden and reduce user‐perceived delay. However, the edge caching placement is still challenging considering the coupling between caching and AP‐user association, limited fronthaul capacity, and multi‐AP deployment in the cell‐free (CF) massive MIMO systems. To this end, the authors establish a framework for the joint problem of AP‐user association and caching to minimize the content delivery delay which considers both cooperation delivery delay and radio access delay. It is an integer nonlinear programming problem and NP‐hard. The optimization problem is first decomposed into an AP‐user association sub‐problem and a caching placement sub‐problem to address this problem. A two‐stage matching algorithm is further proposed to achieve AP‐user association and a modified genetic algorithm to determine caching placement. A computationally efficient iterative algorithm is developed to solve the joint optimization problem. Finally, the global convergence and computational complexity of the proposed strategy are analyzed theoretically. Simulation results reveal that the proposed strategy can achieve better delivery delay performance than benchmark schemes.

Adaptively robust high-dimensional matrix factor analysis under Huber loss function

The explosion of data volume and the expansion in data dimensionality have led to a critical challenge in analyzing high-dimensional matrix time series for big data-related applications. In this regard, factor models for matrix-valued high-dimensional time series provide a powerful tool, that reduces the dimensionality of the variables with low-rank structures. However, existing high-dimensional matrix factor models suffer from two limitations in complex scenarios. One is that it is difficult to make robust inferences for datasets with heavy-tailed distributions. The other is that existing models require additional parameters for fine-tuning to guarantee performance. We propose an adaptively robust high-dimensional matrix factor model based on a specified Huber loss function to tackle the challenges mentioned above. An efficient iterative algorithm is provided to consistently determine the additional parameters of our model for robust estimation. The robustness of the model estimation is greatly improved by incorporating the Huber loss. Furthermore, we theoretically investigate the proposed method and derive the convergence rates of the robust estimators to examine its performance. Simulations show that the proposed method outperforms previous models in the estimation of heavy-tailed data. A real-world data analysis on a financial portfolio dataset illustrates that the method can be used to extract useful knowledge from high-dimensional matrix time series.

Linear Response Equations Revisited: A Simple and Efficient Iterative Algorithm.

We present an algorithm to solve the linear response equations for Hartree-Fock, Density Functional Theory, and the Multiconfigurational Self-Consistent Field method that is both simple and efficient. The algorithm makes use of the well-established symmetric and antisymmetric combinations of trial vectors but further orthogonalizes them with respect to the scalar product induced by the response matrix. This leads to a standard, symmetric block eigenvalue problem in the expansion subspace that can be solved by diagonalizing a symmetric, positive definite matrix half the size of the expansion space. Numerical tests showed that the algorithm is robust and stable.

On the Interplay Between Sensing and Communications for UAV Trajectory Design

The unmanned aerial vehicles (UAVs) are envisioned as promising aerial facilities for providing advanced communication services as well as sensing functionalities in the next-generation wireless system. This paper considers a UAV-enabled integrated sensing and communications (ISAC) system, where a moving ground user (GU) is simultaneously tracked by multiple UAVs and receives the downlink communication information transmitted from the UAV. In particular, to jointly enhance the sensing and communication (S&C) performance, optimizing the UAV moving trajectory is demanded. To achieve this goal, we first harness the extended Kalman filtering (EKF) method for predicting and tracking the motion parameters of GU at each time slot, which relies on the range measurements extracted from the sensing echoes at the base station (BS). Afterward, we formulate a weighted optimization problem that addresses the design of UAV trajectories and GU-UAV association simultaneously, incorporating the consideration of real-time downlink communication rates and the Cramér-Rao bound (CRB) for GU tracking. The problem further is constrained by the maximum consumed power, maximum traveling distance, and minimum collision avoidance distance. As a step forward, to address the resultant non-convex problem, we develop an efficient iterative algorithm to obtain a near-optimal solution by utilizing the successive convex approximate (SCA) technique. Specifically, we alternately solve the GU-UAV association and the real-time trajectory design problem at each time slot. Finally, our numerical simulations illustrate that our proposed algorithm can track the GU accurately while meeting the sensing-centric and/or communication-centric requirements.

Energy Consumption Minimization in Unmanned Aerial Vehicle-Enabled Secure Wireless Sensor Networks

In wireless sensor networks (WSNs), unmanned aerial vehicles (UAVs) are considered an effective data collection tool. In this paper, we investigate the energy-efficient data collection problem in a UAV-enabled secure WSN without knowing the instantaneous channel state information of the eavesdropper (Eve). Specifically, the UAV collected the information from all the wireless sensors at the scheduled time and forward it to the fusion center while Eve tries to eavesdrop on this confidential information from the UAV. To surmount this intractable and convoluted mixed-integer non-convex problem, we propose an efficient iterative optimization algorithm using the block coordinate descent (BCD) method to minimize the maximum energy consumption of the ground sensor nodes (GSNs) under the constraints of secrecy outage probability (SOP), connection outage probability (COP), minimum secure data, information causality, and UAV trajectory. Numerical results demonstrate the superiority of the algorithm we proposed in energy consumption and secrecy rate compared with other schemes.

Joint Beamforming and Backscatter Communication Design for Symbiotic Radio Networks

Symbiotic radio (SR) is a promising energy-, spectrum-and cost-efficient communication technology for Internet of Things. This paper considers an SR network (SRN) in which backscatter devices (BDs) communicate with a primary receiver (PR) by riding on ambient radio frequency carriers from a primary transmitter (PT). First, both the achievable primary rate and backscatter-link sum rate are derived for BDs adopting spatial-division-multiple-access (SDMA) scheme and dynamic time-division-multiple-access (TDMA) scheme, respectively. Then, two optimization problems are formulated to maximize the BDs’ sum rate, by jointly optimizing the PT’s beamforming matrix, and the BDs’ power reflection coefficients as well as the backscatter time allocation. For the single-antenna PR case, the optimal beamforming is obtained in semi-closed forms. For the multi-antenna PR case, to solve the non-convex problems with coupled variables, efficient iterative algorithms are proposed based on block coordinate descent and sequential convex approximation techniques. Finally, numerical results show that the proposed design enhances the SRN’s throughput significantly, and give useful insights on the BDs’ multiple-access schemes.

Local Embedding Learning via Landmark-Based Dynamic Connections.

Linear discriminant analysis (LDA) is one of the most effective and popular methods to reduce the dimensionality of data with Gaussian assumption. However, LDA cannot handle non-Gaussian data because the center point is incompetent to represent the distribution of data. Some existing methods based on graph embedding focus on exploring local structures via pairwise relationships of data for addressing the non-Gaussian issue. Due to massive pairwise relationships, the computational complexity is high as well as the locally optimal solution is hard to find. To address these issues, we propose a novel and efficient local embedding learning via landmark-based dynamic connections (LDC) in which we leverage several landmarks to represent different subclusters in the same class and establish the connections between each point and landmark. Furthermore, in order to explore the relationship of landmarks pairwise more precisely, the relationship between each point and their corresponding neighbor landmarks are found in the optimal subspace, rather than the original space, which can avoid the negative influence of the noises. We also propose an efficient iterative algorithm to deal with the proposed ratio minimization problem. Extensive experiments conducted on several real-world datasets have demonstrated the advantages of the proposed method.

On an Extension of a Spare Regularization Model

In this paper, we would first like to promote an interesting idea for identifying the local minimizer of a non-convex optimization problem with the global minimizer of a convex optimization one. Secondly, to give an extension of their sparse regularization model for inverting incomplete Fourier transforms introduced. Thirdly, following the same lines, to develop convergence guaranteed efficient iteration algorithm for solving the resulting nonsmooth and nonconvex optimization problem but here using applied nonlinear analysis tools. These both lead to a simplification of the proofs and to make a connection with classical works in this filed through a startling comment.

An efficient iterative optimization-based algorithm for the real-time estimation of harmonics under power system frequency deviations

In current electrical power industry, a great number of power electronic devices produce harmonics. Moreover, the fundamental system frequency of a power line can deviate in the cases of fluctuating and periodically varying loads and transients. This frequency deviation introduces further undesirable frequency components in the spectrum. Correct measurement of harmonics under such system frequency deviations has prominent importance for the protection of power electronics devices. For this goal, this paper proposes a new iterative optimization-based algorithm for the estimation of harmonics in these circumstances. The method is based on time-domain Gauss-Newton optimization of distorted power line signal which attains its parameters directly from the spectrum of the signal by employing local extrema of the corresponding spectrum. In the first phase of the algorithm, the deviated system frequency is estimated. In the second phase, the harmonic components are estimated and fine-tuned correspondingly. Case studies show that the proposed method is robust and precisely estimates deviations in the system’s fundamental frequency and measure the amplitudes of harmonic components very accurately. It requires just a stoppage criterion. The computational assessment of the method also shows its time efficiency in identifying harmonics. Thus, it is a very good candidate for real-time harmonic measurements.

STARS Enabled Integrated Sensing and Communications

A simultaneously transmitting and reflecting surface (STARS) enabled integrated sensing and communications (ISAC) framework is proposed, where the entire space is partitioned by STARS into a sensing space and a communication space. A novel sensing-at-STARS structure is proposed, where dedicated sensors are mounted at STARS to address the significant path loss and clutter interference of sensing. The Cramér-Rao bound (CRB) of the two-dimensional (2D) direction-of-arrivals (DOAs) estimation of the sensing target is derived, which is then minimized subject to the minimum communication requirement. A novel approach is proposed to transform the complicated CRB minimization problem into a trackable modified Fisher information matrix (FIM) optimization problem. Both independent and coupled phase-shift models of STARS are investigated: 1) For the independent phase-shift model, to address the coupling problem of ISAC waveform and STARS coefficient, an efficient double-loop iterative algorithm based on the penalty dual decomposition (PDD) framework is conceived; 2) For the coupled phase-shift model, based on the PDD framework, a low complexity alternating optimization algorithm is proposed to tackle the coupled phase-shift constraint by alternately optimizing the amplitude and phase-shift coefficients of STARS with closed-form expressions. Finally, the numerical results demonstrate that: 1) STARS significantly outperforms conventional RIS in terms of CRB under the communication constraints; 2) The coupled phase-shift model achieves comparable performance to the independent one for low communication requirements or sufficient STARS elements; 3) It is more efficient to increase the number of passive elements of STARS than the active elements of the sensor; 4) Higher sensing accuracy can be achieved by STARS using the practical 2D maximum likelihood estimator compared with the conventional RIS.

RIS-Aided MIMO Systems With Hardware Impairments: Robust Beamforming Design and Analysis

Reconfigurable intelligent surface (RIS) has been anticipated to be a novel cost-effective technology to improve the performance of future wireless systems. In this paper, we investigate a practical RIS-aided multiple-input-multiple-output (MIMO) system in the presence of transceiver hardware impairments, RIS phase noise and imperfect channel state information (CSI). Joint design of the MIMO transceiver and RIS reflection matrix to minimize the total average mean-square-error (MSE) of all data streams is particularly considered. This joint design problem is non-convex and challenging to solve due to the newly considered practical imperfections. To tackle the issue, we first analyze the total average MSE by incorporating the impacts of the above system imperfections. Then, in order to handle the tightly coupled optimization variables and non-convex NP-hard constraints, an efficient iterative algorithm based on alternating optimization (AO) framework is proposed with guaranteed convergence, where each subproblem admits a closed-form optimal solution by leveraging the majorization-minimization (MM) technique. Moreover, via exploiting the special structure of the unit-modulus constraints, we propose a modified Riemannian gradient ascent (RGA) algorithm for the discrete RIS phase shift optimization. Furthermore, the optimality of the proposed algorithm is validated under line-of-sight (LoS) channel conditions, and the irreducible MSE floor effect induced by imperfections of both hardware and CSI is also revealed in the high signal-to-noise ratio (SNR) regime. Numerical results show the superior MSE performance of our proposed algorithm over the adopted benchmark schemes, and demonstrate that increasing the number of RIS elements is not always beneficial under the above system imperfections.

UAV-assisted NOMA secure communications: joint transmit power and trajectory optimization

With the inherent advantages of exceptional maneuverability, flexible deployment options and cost-effectiveness, unmanned aerial vehicles (UAVs) present themselves as a viable solution for providing aerial communication services to Internet of Things devices in high-traffic or remote areas. Nevertheless, the openness of the air–ground channel poses significant security challenges to UAV-based wireless systems. In this paper, a UAV-assisted secure communication system model is established based on non-orthogonal multiple access (NOMA) from the perspective of physical layer security, aiming to conceal the transmission behavior between UAVs and legitimate users (LUs). Specifically, a mobile UAV assumes the role of an aerial base station, leveraging NOMA technique to transmit data to LUs while evading detection from mobile eavesdropper situated on the ground. To fortify the security performance of the system, a hovering UAV acts as a friendly jammer and transmits interference signals to mobile eavesdropper (referred to as Eve). The objective of this scheme is to maximize the minimum average secure rate of all LUs by meticulously optimizing the trajectory and power allocation of the mobile UAV, subject to secrecy performance constraints. The highly interdependent and non-convex nature of this optimization problem renders direct solutions infeasible. Hence, this paper designs an efficient iterative algorithm that decouples the original problem into two subproblems, enabling an alternating optimization process for the trajectory and power allocation of the mobile UAV until the convergence of the objective function is achieved. Simulation results demonstrate that the proposed algorithm effectively improves the minimum average secure rate of all LUs compared with the benchmark scheme.

Energy efficiency maximization for UAV-enabled amplify-and-forward relaying via joint power and trajectory optimization

This paper investigates an optimization problem corresponding to energy efficiency maximization of an unmanned aerial vehicle (UAV)-enabled relaying system, where a fixed-wing UAV acts as an amplify-and-forward mobile relay to assist data transmission between a source node and a destination node. On the premise of satisfying the speed and acceleration constraints of the UAV, the energy efficiency (EE) of the relaying system is maximized by jointly optimizing the UAV’s trajectory and the individual transmit power levels of the source and the UAV relay. The initial joint optimization problem is non-convex and cannot be solved directly. Therefore, the joint optimization problem is decomposed into two sub-problems which are solved by applying the successive convex approximation technique and the Dinkelbach’s algorithm. On this basis, an efficient iterative algorithm is proposed to tackle the joint optimization problem through the block coordinate descent technique. Simulation results demonstrated that by conducting the proposed algorithm, the flight trajectory of the UAV and the individual transmit power levels of the nodes can be flexibly adjusted according to the system conditions, and the proposed algorithm contributes to the higher EE compared with the benchmark schemes.