Aiming at multi-agent coordinated scheduling problems in power systems under uncertainty,a generic projection and decomposition(P&D)approach is proposed in this letter.The canonical min-max-min two-stage robust op...Aiming at multi-agent coordinated scheduling problems in power systems under uncertainty,a generic projection and decomposition(P&D)approach is proposed in this letter.The canonical min-max-min two-stage robust optimization(TSRO)model with coupling constraints is equivalent to a concise robust optimization(RO)model in the version of mixed-integer linear programming(MILP)via feasible region projection.The decentralized decoupling of the non-convex MILP problem is realized through a dual decomposition algorithm,which ensures the fast convergence to a high-quality solution in the distributed optimization.Numerical tests verify the superior performance of the proposed P&D approach over the existing distributed TSRO method.展开更多
In order to solve the electromagnetic problems on the large multi branch domains, the decomposition projective method(DPM) is generalized for multi subspaces in this paper. Furthermore multi parameters are designed fo...In order to solve the electromagnetic problems on the large multi branch domains, the decomposition projective method(DPM) is generalized for multi subspaces in this paper. Furthermore multi parameters are designed for DPM, which is called the fast DPM(FDPM), and the convergence ratio of the above algorithm is greatly increased. The examples show that the iterative number of the FDPM with optimal parameters decreases much more, which is less than one third of the DPM iteration number. After studying the ...展开更多
A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decompositi...A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decomposition （MCAED） algorithm, the proposed method can iteratively estimate impulse response coefficients between the speech source and microphones by the adaptive subgradient projection method. Then, it acquires the time delays of microphone pairs, and calculates the source position by the geometric method. Compared with the traditional normal least mean square （NLMS） algorithm, the adaptive subgradient projection method achieves faster and more accurate convergence in a low signal-to-noise ratio （SNR） environment. Simulations for glasses digital hearing aids with four-component square array demonstrate the robust performance of the proposed method.展开更多
The solution of the dynamic problem of multibody systems subject to rheonomic and nonholonomic constraints is achieved by applying singular value decomposition of the constraint matrix and projections of the dynamic e...The solution of the dynamic problem of multibody systems subject to rheonomic and nonholonomic constraints is achieved by applying singular value decomposition of the constraint matrix and projections of the dynamic equations of the systems along the feasible and unfeasible directions of the constraints. Formula to solve the constraint reaction forces and a method to avoid the violation of the constraints are also given.The solution does not rely on coordinates used to describe the systems and is computational efficitive example is finally presnted.展开更多
基金supported in part by the National Research Foundation(NRF)of Singapore,Intra-CREATE(No.NRF2022-ITS010-0005)Ministry of Education Singapore under its Award Ac RF TIER 1 RG60/22the NRF of Singapore,Energy Market Authority under its Energy Programme(EP Award EMAEP004-EKJGC-0003)。
文摘Aiming at multi-agent coordinated scheduling problems in power systems under uncertainty,a generic projection and decomposition(P&D)approach is proposed in this letter.The canonical min-max-min two-stage robust optimization(TSRO)model with coupling constraints is equivalent to a concise robust optimization(RO)model in the version of mixed-integer linear programming(MILP)via feasible region projection.The decentralized decoupling of the non-convex MILP problem is realized through a dual decomposition algorithm,which ensures the fast convergence to a high-quality solution in the distributed optimization.Numerical tests verify the superior performance of the proposed P&D approach over the existing distributed TSRO method.
文摘In order to solve the electromagnetic problems on the large multi branch domains, the decomposition projective method(DPM) is generalized for multi subspaces in this paper. Furthermore multi parameters are designed for DPM, which is called the fast DPM(FDPM), and the convergence ratio of the above algorithm is greatly increased. The examples show that the iterative number of the FDPM with optimal parameters decreases much more, which is less than one third of the DPM iteration number. After studying the ...
基金Supported by the National Natural Science Foundation of China (60872073)~~
文摘A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decomposition （MCAED） algorithm, the proposed method can iteratively estimate impulse response coefficients between the speech source and microphones by the adaptive subgradient projection method. Then, it acquires the time delays of microphone pairs, and calculates the source position by the geometric method. Compared with the traditional normal least mean square （NLMS） algorithm, the adaptive subgradient projection method achieves faster and more accurate convergence in a low signal-to-noise ratio （SNR） environment. Simulations for glasses digital hearing aids with four-component square array demonstrate the robust performance of the proposed method.
文摘The solution of the dynamic problem of multibody systems subject to rheonomic and nonholonomic constraints is achieved by applying singular value decomposition of the constraint matrix and projections of the dynamic equations of the systems along the feasible and unfeasible directions of the constraints. Formula to solve the constraint reaction forces and a method to avoid the violation of the constraints are also given.The solution does not rely on coordinates used to describe the systems and is computational efficitive example is finally presnted.
