Applying Convex Optimal Power Flow to Combined Economic and Emission Dispatch

This paper addresses the problem of reducing CO2 emissions by applying convex optimal power flow model to the combined economic and emission dispatch problem. The large amount of CO2 emissions in the power industry is a major source of global warming effect. An efficient and economic approach to reduce CO2 emissions is to formulate the emission reduction problem as emission dispatch problem and combined with power system economic dispatch (ED). Because the traditional optimal power flow (OPF) model used by the economic dispatch is nonlinear and nonconvex, current nonlinear solvers are not able to find the global optimal solutions. In this paper, we use the convex optimal power flow model to formulate the combined economic and emission dispatch problem. The advantage of using convex power flow model is that global optimal solutions can be obtained by using mature industrial strength nonlinear solvers such as MOSEK. Numerical results of various IEEE power network test cases confirm the feasibility and advantage of convex combined economic and emission dispatch (CCEED).

Optimal Positioning Strategy for Multi-Camera Zooming Drones

In the context of multiple-target tracking and surveillance applications,this paper investigates the challenge of determining the optimal positioning of a single autonomous aerial vehicle or agent equipped with multiple independently-steerable zooming cameras to effectively monitor a set of targets of interest.Each camera is dedicated to tracking a specific target or cluster of targets.The key innovation of this study,in comparison to existing approaches,lies in incorporating the zooming factor for the onboard cameras into the optimization problem.This enhancement offers greater flexibility during mission execution by allowing the autonomous agent to adjust the focal lengths of the onboard cameras,in exchange for varying real-world distances to the corresponding targets,thereby providing additional degrees of freedom to the optimization problem.The proposed optimization framework aims to strike a balance among various factors,including distance to the targets,verticality of viewpoints,and the required focal length for each camera.The primary focus of this paper is to establish the theoretical groundwork for addressing the non-convex nature of the optimization problem arising from these considerations.To this end,we develop an original convex approximation strategy.The paper also includes simulations of diverse scenarios,featuring varying numbers of onboard tracking cameras and target motion profiles,to validate the effectiveness of the proposed approach.

Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems

The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization problems.In this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual vari-ables.By satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence rate.This only requires assuming convexity of the objective function.We validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments.

Multiconstraint adaptive three-dimensional guidance law using convex optimization

The traditional guidance law only guarantees the accuracy of attacking a target. However, the look angle and acceleration constraints are indispensable in applications. A new adaptive three-dimensional proportional navigation(PN) guidance law is proposed based on convex optimization. Decomposition of the three-dimensional space is carried out to establish threedimensional kinematic engagements. The constraints and the performance index are disposed by using the convex optimization method. PN guidance gains can be obtained by solving the optimization problem. This solution is more rapid and programmatic than the traditional method and provides a foundation for future online guidance methods, which is of great value for engineering applications.

Channel Estimation for Reconfigurable Intelligent Surface Aided Multiuser Millimeter-Wave/THz Systems

It is assumed that reconfigurable intelligent surface(RIS)is a key technology to enable the potential of mmWave communications.The passivity of the RIS makes channel estimation difficult because the channel can only be measured at the transceiver and not at the RIS.In this paper,we propose a novel separate channel estimator via exploiting the cascaded sparsity in the continuously valued angular domain of the cascaded channel for the RIS-enabled millimeter-wave/Tera-Hz systems,i.e.,the two-stage estimation method where the cascaded channel is separated into the base station(BS)-RIS and the RIS-user(UE)ones.Specifically,we first reveal the cascaded sparsity,i.e.,the sparsity exists in the hybrid angular domains of BS-RIS and the RIS-UEs separated channels,to construct the specific sparsity structure for RIS enabled multi-user systems.Then,we formulate the channel estimation problem using atomic norm minimization(ANM)to enhance the proposed sparsity structure in the continuous angular domains,where a low-complexity channel estimator via Alternating Direction Method of Multipliers(ADMM)is proposed.Simulation findings demonstrate that the proposed channel estimator outperforms the current state-of-the-arts in terms of performance.

Cooperative User-Scheduling and Resource Allocation Optimization for Intelligent Reflecting Surface Enhanced LEO Satellite Communication

Lower Earth Orbit(LEO) satellite becomes an important part of complementing terrestrial communication due to its lower orbital altitude and smaller propagation delay than Geostationary satellite. However, the LEO satellite communication system cannot meet the requirements of users when the satellite-terrestrial link is blocked by obstacles. To solve this problem, we introduce Intelligent reflect surface(IRS) for improving the achievable rate of terrestrial users in LEO satellite communication. We investigated joint IRS scheduling, user scheduling, power and bandwidth allocation(JIRPB) optimization algorithm for improving LEO satellite system throughput.The optimization problem of joint user scheduling and resource allocation is formulated as a non-convex optimization problem. To cope with this problem, the nonconvex optimization problem is divided into resource allocation optimization sub-problem and scheduling optimization sub-problem firstly. Second, we optimize the resource allocation sub-problem via alternating direction multiplier method(ADMM) and scheduling sub-problem via Lagrangian dual method repeatedly.Third, we prove that the proposed resource allocation algorithm based ADMM approaches sublinear convergence theoretically. Finally, we demonstrate that the proposed JIRPB optimization algorithm improves the LEO satellite communication system throughput.

An optimization-oriented modeling approach using input convex neural networks and its application on optimal chiller loading

Optimization for the multi-chiller system is an indispensable approach for the operation of highly efficient chiller plants.The optima obtained by model-based optimization algorithms are dependent on precise and solvable objective functions.The classical neural networks cannot provide convex input-output mappings despite capturing impressive nonlinear fitting capabilities,resulting in a reduction in the robustness of model-based optimization.In this paper,we leverage the input convex neural networks(ICNN)to identify the chiller model to construct a convex mapping between control variables and the objective function,which enables the NN-based OCL as a convex optimization problem and apply it to multi-chiller optimization for optimal chiller loading(OCL).Approximation performances are evaluated through a four-model comparison based on an experimental data set,and the statistical results show that,on the premise of retaining prior convexities,the proposed model depicts excellent approximation power for the data set,especially the unseen data.Finally,the ICNN model is applied to a typical OCL problem for a multi-chiller system and combined with three types of optimization strategies.Compared with conventional and meta-heuristic methods,the numerical results suggest that the gradient-based BFGS algorithm provides better energy-saving ratios facing consecutive cooling load inputs and an impressive convergence speed.

A novel image segmentation approach for wood plate surface defect classification through convex optimization

Detection of wood plate surface defects using image processing is a complicated problem in the forest industry as the image of the wood surface contains different kinds of defects. In order to obtain complete defect images, we used convex optimization(CO) with different weights as a pretreatment method for smoothing and the Otsu segmentation method to obtain the target defect area images. Structural similarity(SSIM) results between original image and defect image were calculated to evaluate the performance of segmentation with different convex optimization weights. The geometric and intensity features of defects were extracted before constructing a classification and regression tree(CART) classifier. The average accuracy of the classifier is 94.1% with four types of defects on Xylosma congestum wood plate surface: pinhole, crack,live knot and dead knot. Experimental results showed that CO can save the edge of target defects maximally, SSIM can select the appropriate weight for CO, and the CART classifier appears to have the advantages of good adaptability and high classification accuracy.

A new primal-dual interior-point algorithm for convex quadratic optimization

In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization （CQO） based on a kernel function is presented. The proposed function has some properties that are easy for checking. These properties enable us to improve the polynomial complexity bound of a large-update interior-point method （IPM） to O（√n log nlog n/e）, which is the currently best known polynomial complexity bound for the algorithm with the large-update method. Numerical tests were conducted to investigate the behavior of the algorithm with different parameters p, q and θ, where p is the growth degree parameter, q is the barrier degree of the kernel function and θ is the barrier update parameter.

Learning Convex Optimization Models

A convex optimization model predicts an output from an input by solving a convex optimization problem.The class of convex optimization models is large,and includes as special cases many well-known models like linear and logistic regression.We propose a heuristic for learning the parameters in a convex optimization model given a dataset of input-output pairs,using recently developed methods for differentiating the solution of a convex optimization problem with respect to its parameters.We describe three general classes of convex optimization models,maximum a posteriori(MAP)models,utility maximization models,and agent models,and present a numerical experiment for each.

Performance Analysis of Sparse Array based Massive MIMO via Joint Convex Optimization

Massive multiple-input multiple-output(MIMO)technology enables higher data rate transmission in the future mobile communications.However,exploiting a large number of antenna elements at base station(BS)makes effective implementation of massive MIMO challenging,due to the size and weight limits of the masssive MIMO that are located on each BS.Therefore,in order to miniaturize the massive MIMO,it is crucial to reduce the number of antenna elements via effective methods such as sparse array synthesis.In this paper,a multiple-pattern synthesis is considered towards convex optimization(CO).The joint convex optimization(JCO)based synthesis is proposed to construct a codebook for beamforming.Then,a criterion containing multiple constraints is developed,in which the sparse array is required to fullfill all constraints.Finally,extensive evaluations are performed under realistic simulation settings.The results show that with the same number of antenna elements,sparse array using the proposed JCO-based synthesis outperforms not only the uniform array,but also the sparse array with the existing CO-based synthesis method.Furthermore,with a half of the number of antenna elements that on the uniform array,the performance of the JCO-based sparse array approaches to that of the uniform array.

Computation of Peak Output for Inputs Restricted in L_2 and L_∞ Norms Using Finite Difference Schemes and Convex Optimization

Control systems designed by the principle of matching gives rise to problems of evaluating the peak output. This paper proposes a practical method for computing the peak output of linear time-invariant and non-anticipative systems for a class of possible sets that are characterized with many bounding conditions on the two- and/or the infinity-norms of the inputs and their derivatives. The original infinite-dimensional convex optimization problem is approximated as a large-scale convex programme defined in a Euclidean space, which are associated with sparse matrices and thus can be solved efficiently in practice. The numerical results show that the method performs satisfactorily, and that using a possible set with many bounding conditions can help to reduce the design conservatism and thereby yield a better match.

DOWNWARD LOOKING SPARSE LINEAR ARRAY 3D SAR IMAGING ALGORITHM BASED ON BACK-PROJECTION AND CONVEX OPTIMIZATION

Downward Looking Sparse Linear Array Three Dimensional SAR(DLSLA 3D SAR) is an important form of 3D SAR imaging, which has a widespread application field. Since its practical equivalent phase centers are usually distributed sparsely and nonuniformly, traditional 3D SAR algorithms suffer from low resolution and high sidelobes in cross-track dimension. To deal with this problem, this paper introduces a method based on back-projection and convex optimization to achieve 3D high accuracy imaging reconstruction. Compared with traditional SAR algorithms, the proposed method sufficiently utilizes the sparsity of the 3D SAR imaging scene and can achieve lower sidelobes and higher resolution in cross-track dimension. In the simulated experiments, the reconstructed results of both simple and complex imaging scene verify that the proposed method outperforms 3D back-projection algorithm and shows satisfying cross-track dimensional resolution and good robustness to noise.

Stabilization of linear time-varying systems with state and input constraints using convex optimization

The stabilization problem of linear time-varying systems with both state and input constraints is considered. Sufficient conditions for the existence of the solution to this problem are derived and a gain-switched（gain-scheduled） state feedback control scheme is built to stabilize the constrained timevarying system. The design problem is transformed to a series of convex feasibility problems which can be solved efficiently. A design example is given to illustrate the effect of the proposed algorithm.

Binary Tomography Reconstruction with Limited-Data by a Convex Level-Set Method

This paper proposes a new level-set-based shape recovery approach that can be applied to a wide range of binary tomography reconstructions.In this technique,we derive generic evolution equations for shape reconstruction in terms of the underlying level-set parameters.We show that using the appropriate basis function to parameterize the level-set function results in an optimization problem with a small number of parameters,which overcomes many of the problems associated with the traditional level-set approach.More concretely,in this paper,we use Gaussian functions as a basis function placed at sparse grid points to represent the parametric level-set function and provide more flexibility in the binary representation of the reconstructed image.In addition,we suggest a convex optimization method that can overcome the problem of the local minimum of the cost function by successfully recovering the coefficients of the basis function.Finally,we illustrate the performance of the proposed method using synthetic images and real X-ray CT projection data.We show that the proposed reconstruction method compares favorably to various state-of-the-art reconstruction techniques for limited-data tomography,and it is also relatively stable in the presence of modest amounts of noise.Furthermore,the shape representation using a compact Gaussian radial basis function works well.

Optimal Beamforming for Secure Transmit in Practical Wireless Networks

In real communication systems,secure and low-energy transmit scheme is very important.So far,most of schemes focus on secure transmit in special scenarios.In this paper,our goal is to propose a secure protocol in wireless networks involved various factors including artificial noise(AN),the imperfect receiver and imperfect channel state information(CSI)of eavesdropper,weight of beamforming(BF)vector,cooperative jammers(CJ),multiple receivers,and multiple eavesdroppers,and the analysis shows that the protocol can reduce the transmission power,and at the same time the safe reachability rate is greater than our pre-defined value,and the analysis results are in good agreement with the simulation results.In this letter,the minimal transmit power is modeled as a non-convexity optimization that is general difficult.Our method is to transform it into a two-level non-convex problem.The outer is a univariate optimization that can be solved by the golden search algorithm.The inner is a convex optimization solved by using the CVX.The solutions are further used to improve the confidentiality rate of the system,and reduce the transmit power of the system and resource consumption in terms of the imperfect CSI.Simulations show the efficiency and robustness of the proposed protocol.

Application of Convex Optimization to Queuing Systems

On the basis of the queuing theory, a nonlinear optimal load allocation model is proposed. A novel transformafion method for the optimization variables is also presented, and the constraints are properly combined so as to make this model convex. The interior-point method for convex optimization is presented as an efficient computational tool. Finally, this model is evaluated by a real example,from which the following conclusions are drawn： the optimum result can ensure the full utilization of machines and the smallest amount of WIP （work-in-progress） in queuing systems; the interior-point method needs a few iterations with significant computational savings; other performance measures of queuing systems can also be optimized in a similar way.

A Regularized Newton Method with Correction for Unconstrained Convex Optimization

In this paper, we present a regularized Newton method (M-RNM) with correction for minimizing a convex function whose Hessian matrices may be singular. At every iteration, not only a RNM step is computed but also two correction steps are computed. We show that if the objective function is LC2, then the method posses globally convergent. Numerical results show that the new algorithm performs very well.

Online Optimization in Power Systems With High Penetration of Renewable Generation:Advances and Prospects

Traditionally,offline optimization of power systems is acceptable due to the largely predictable loads and reliable generation.The increasing penetration of fluctuating renewable generation and internet-of-things devices allowing for fine-grained controllability of loads have led to the diminishing applicability of offline optimization in the power systems domain,and have redirected attention to online optimization methods.However,online optimization is a broad topic that can be applied in and motivated by different settings,operated on different time scales,and built on different theoretical foundations.This paper reviews the various types of online optimization techniques used in the power systems domain and aims to make clear the distinction between the most common techniques used.In particular,we introduce and compare four distinct techniques used covering the breadth of online optimization techniques used in the power systems domain,i.e.,optimization-guided dynamic control,feedback optimization for single-period problems,Lyapunov-based optimization,and online convex optimization techniques for multi-period problems.Lastly,we recommend some potential future directions for online optimization in the power systems domain.

Digital Twin-Assisted Knowledge Distillation Framework for Heterogeneous Federated Learning

In this paper,to deal with the heterogeneity in federated learning(FL)systems,a knowledge distillation(KD)driven training framework for FL is proposed,where each user can select its neural network model on demand and distill knowledge from a big teacher model using its own private dataset.To overcome the challenge of train the big teacher model in resource limited user devices,the digital twin(DT)is exploit in the way that the teacher model can be trained at DT located in the server with enough computing resources.Then,during model distillation,each user can update the parameters of its model at either the physical entity or the digital agent.The joint problem of model selection and training offloading and resource allocation for users is formulated as a mixed integer programming(MIP)problem.To solve the problem,Q-learning and optimization are jointly used,where Q-learning selects models for users and determines whether to train locally or on the server,and optimization is used to allocate resources for users based on the output of Q-learning.Simulation results show the proposed DT-assisted KD framework and joint optimization method can significantly improve the average accuracy of users while reducing the total delay.