To improve the deteriorated capacity gain and source recovery performance due to channel mismatch problem,this paper reports a research about blind separation method against channel mismatch in multiple-input multiple...To improve the deteriorated capacity gain and source recovery performance due to channel mismatch problem,this paper reports a research about blind separation method against channel mismatch in multiple-input multiple-output(MIMO) systems.The channel mismatch problem can be described as a channel with bounded fluctuant errors due to channel distortion or channel estimation errors.The problem of blind signal separation/extraction with channel mismatch is formulated as a cost function of blind source separation(BSS) subject to the second-order cone constraint,which can be called as second-order cone programing optimization problem.Then the resulting cost function is solved by approximate negentropy maximization using quasi-Newton iterative methods for blind separation/extraction source signals.Theoretical analysis demonstrates that the proposed algorithm has low computational complexity and improved performance advantages.Simulation results verify that the capacity gain and bit error rate(BER) performance of the proposed blind separation method is superior to those of the existing methods in MIMO systems with channel mismatch problem.展开更多
A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming （SOCP） by using the Alizadeh- Haeberly-Overton （AHO） search direction. This algorith...A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming （SOCP） by using the Alizadeh- Haeberly-Overton （AHO） search direction. This algorithm does not require the feasibility of the initial points and iteration points. Under suitable assumptions, it is shown that the algorithm can find an -approximate solution of an SOCP in at most O（√n ln（ε0/ε）） iterations. The iteration-complexity bound of our algorithm is almost the same as the best known bound of feasible interior point algorithms for the SOCP.展开更多
In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space w...In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.展开更多
This paper investigates the optimal control problem of spacecraft reorientation subject to attitude forbidden constraints,angular velocity saturation and actuator saturation simultaneously.A second-order cone programm...This paper investigates the optimal control problem of spacecraft reorientation subject to attitude forbidden constraints,angular velocity saturation and actuator saturation simultaneously.A second-order cone programming(SOCP)technology is developed to solve the strong nonlinear and non-convex control problem in real time.Specifically,the nonlinear attitude kinematic and dynamic are transformed and relaxed to a standard affine system,and linearization and L1 penalty technique are adopted to convexify non-convex inequality constraints.With the proposed quadratic performance index of angular velocity,the optimal control solution is obtained with high accuracy using the successive SOCP algorithm.Finally,the effectiveness of the algorithm is validated by numerical simulation.展开更多
基金supported by Sichuan Youth Science and Technology Innovation Research Team Project(No.2015TD0022)the Talents Project of Sichuan University of Science and Engineering(No.2017RCL11 and No.2017RCL10)the first batch of science and technology plan key R&D project of Sichuan province(No.2017GZ0068)
文摘To improve the deteriorated capacity gain and source recovery performance due to channel mismatch problem,this paper reports a research about blind separation method against channel mismatch in multiple-input multiple-output(MIMO) systems.The channel mismatch problem can be described as a channel with bounded fluctuant errors due to channel distortion or channel estimation errors.The problem of blind signal separation/extraction with channel mismatch is formulated as a cost function of blind source separation(BSS) subject to the second-order cone constraint,which can be called as second-order cone programing optimization problem.Then the resulting cost function is solved by approximate negentropy maximization using quasi-Newton iterative methods for blind separation/extraction source signals.Theoretical analysis demonstrates that the proposed algorithm has low computational complexity and improved performance advantages.Simulation results verify that the capacity gain and bit error rate(BER) performance of the proposed blind separation method is superior to those of the existing methods in MIMO systems with channel mismatch problem.
基金the National Science Foundation(60574075, 60674108)
文摘A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming （SOCP） by using the Alizadeh- Haeberly-Overton （AHO） search direction. This algorithm does not require the feasibility of the initial points and iteration points. Under suitable assumptions, it is shown that the algorithm can find an -approximate solution of an SOCP in at most O（√n ln（ε0/ε）） iterations. The iteration-complexity bound of our algorithm is almost the same as the best known bound of feasible interior point algorithms for the SOCP.
基金supported by the National Natural Science Foundation of China(11401126,71471140 and 11361018)Guangxi Natural Science Foundation(2016GXNSFBA380102 and 2014GXNSFFA118001)+2 种基金Guangxi Key Laboratory of Cryptography and Information Security(GCIS201618)Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ15112 and YQ16112)China
文摘In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
基金This work was supported by the National Natural Science Foundation of China(Nos.61960206011,61633003)the Beijing Natural Science Foundation(No.JQ19017)。
文摘This paper investigates the optimal control problem of spacecraft reorientation subject to attitude forbidden constraints,angular velocity saturation and actuator saturation simultaneously.A second-order cone programming(SOCP)technology is developed to solve the strong nonlinear and non-convex control problem in real time.Specifically,the nonlinear attitude kinematic and dynamic are transformed and relaxed to a standard affine system,and linearization and L1 penalty technique are adopted to convexify non-convex inequality constraints.With the proposed quadratic performance index of angular velocity,the optimal control solution is obtained with high accuracy using the successive SOCP algorithm.Finally,the effectiveness of the algorithm is validated by numerical simulation.
