Adaptive broadband beamforraing is a key issue in array applications. The adaptive broadband beamformer with tapped delay line （TDL） structure for nonuniform linear array （NLA） is designed according to the rule of...Adaptive broadband beamforraing is a key issue in array applications. The adaptive broadband beamformer with tapped delay line （TDL） structure for nonuniform linear array （NLA） is designed according to the rule of minimizing the beamformer＇s output power while keeping the distortionless response （DR） in the direction of desired signal and keeping the constant beamwidth （CB） with the prescribed sidelobe level over the whole operating band. This kind of beamforming problem can be solved with the interior-point method after being converted to the form of standard second order cone programming （SOCP）. The computer simulations are presented which illustrate the effectiveness of our beamformer.展开更多
Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming （SOCP） are presented. The two algor...Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming （SOCP） are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton （AHO） directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O（rln（εo/ε）） is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective.展开更多
A vu-decomposition method for solving a second-order cone problem is presented in this paper. It is first transformed into a nonlinear programming problem. Then, the structure of the Clarke subdifferential correspondi...A vu-decomposition method for solving a second-order cone problem is presented in this paper. It is first transformed into a nonlinear programming problem. Then, the structure of the Clarke subdifferential corresponding to the penalty function and some results of itsvu-decomposition are given. Under a certain condition, a twice continuously differentiable trajectory is computed to produce a second-order expansion of the objective function. A conceptual algorithm for solving this problem with a superlinear convergence rate is given.展开更多
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.展开更多
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.展开更多
An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a...An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a nonlinear optimal control problem,which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints.After convexification treatments and discretization,the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming(SOCP)problems,which can be readily solved by state-of-the-art Interior-Point Methods(IPMs).To mitigate the sensibility of the algorithm on the user-provided initial profile,a Two-Stage Sequential Convex Programming(TSSCP)method is presented in detail.Furthermore,numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem.The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.展开更多
智能软开关(soft normally open point, SNOP)凭借其灵活的功率调节能力逐渐应用于配电网中。但由于大量分布式电源(distributed generation, DG)接入,SNOP受到线路容量的限制,调节能力有限。为发挥其最大调节能力,文中提出适用于配电...智能软开关(soft normally open point, SNOP)凭借其灵活的功率调节能力逐渐应用于配电网中。但由于大量分布式电源(distributed generation, DG)接入,SNOP受到线路容量的限制,调节能力有限。为发挥其最大调节能力,文中提出适用于配电系统的SNOP对线路有功功率裕度调节灵敏度的定义,将其作为SNOP调节能力的评价指标,由此建立SNOP的选址优化模型。在此基础上,引入系统节点电压裕度以及线路功率裕度2个安全评价指标,构建以综合运行裕度最大为目标函数的配电网运行优化模型。将上述模型转化为二阶锥模型,通过MATLAB工具实现该问题的有效求解。最后,通过改进的IEEE 33节点算例对所提模型与求解方法进行验证,进一步表明了所提选址方法能够发挥SNOP的最大调节作用,优化控制策略可以实现配电网安全经济运行。展开更多
针对基于能量管理的高速飞行器轨迹优化问题,考虑发动机工作过程对飞行状态严格的约束要求,提出一种基于凸优化的高速飞行器轨迹优化方法。即认为发动机燃油耗尽关机、飞行器动力一定的前提下,求解射程最远的优化轨迹以满足高速长远距...针对基于能量管理的高速飞行器轨迹优化问题,考虑发动机工作过程对飞行状态严格的约束要求,提出一种基于凸优化的高速飞行器轨迹优化方法。即认为发动机燃油耗尽关机、飞行器动力一定的前提下,求解射程最远的优化轨迹以满足高速长远距离飞行任务需求。首先,在飞行器纵向动力学质点模型基础上进行简化处理,得到以飞行器质量为变量的四阶动力学方程,将考虑发动机工作约束的飞行器射程的最优轨迹求解问题,转化为一系列非线性规划问题;接着,将非线性规划问题转化为二阶锥规划(Second Order Cone Program,SOCP)问题,对动力学方程以及不等式约束线性化、离散化处理后,采用原对偶内点法求解,获得最优轨迹;最后,仿真验证了所提优化方法在发动机工作约束范围内,解得了射程最大的最优轨迹。展开更多
针对配电网中分布式电源渗透率提高导致的潮流倒送、电压波动和供电能力不足等问题,文中提出一种基于储能特性的三端智能软开关(three-terminal intelligent soft open point, E-SOP)有源配电台区优化控制策略。首先,深入分析E-SOP的拓...针对配电网中分布式电源渗透率提高导致的潮流倒送、电压波动和供电能力不足等问题,文中提出一种基于储能特性的三端智能软开关(three-terminal intelligent soft open point, E-SOP)有源配电台区优化控制策略。首先,深入分析E-SOP的拓扑,建立其数学模型,为后续优化控制奠定基础。其次,提出一种基于电压-功率灵敏度的ESOP选址规划模型,以确定其最佳安装位置。在此基础上,构建以综合费用和电压偏差最小化为目标的优化模型,实现E-SOP容量配置。该模型通过锥松弛技术转换为二阶锥规划模型,并采用粒子群算法求解。最后,通过IEEE33节点柔性互联系统的仿真验证所提策略的有效性,并在IEEE 69节点系统中进一步验证其适用性和优越性。结果表明,相比传统无E-SOP互联系统,所提策略可使电压偏差降低2.24%,日均损耗减少50.41%,综合成本下降21.74%,适用于不同规模的配电系统。展开更多
为解决配网对新能源承载力不足的问题,文中提出了一种考虑软开关(Soft Open Point,SOP)和负荷主动电压控制的联合规划模型和求解方法。建立应用于配电网规划的SOP数学模型,分别针对多项式形式和指数形式的负荷电压特性建立线性化模型。...为解决配网对新能源承载力不足的问题,文中提出了一种考虑软开关(Soft Open Point,SOP)和负荷主动电压控制的联合规划模型和求解方法。建立应用于配电网规划的SOP数学模型,分别针对多项式形式和指数形式的负荷电压特性建立线性化模型。以分布式新能源承载力、投资成本和运行成本为目标,建立有源配网两阶段随机二阶锥规划模型,对SOP、电容器组以及分布式新能源等设备的选址定容及其日内运行策略做出决策。考虑新能源、负荷和能源价格的不确定性,提出了基于K均值的场景聚类方法,提出了基于信赖域法的Benders分解算法来求解所提模型。通过改进51节点系统验证了所提模型的有效性和正确性,并分析了SOP与主动电压控制对新能源承载力的影响。展开更多
基金supported by the National Nature Science Foundation of China (60472101)President Award of ChineseAcademy of Sciences(O729031511).
文摘Adaptive broadband beamforraing is a key issue in array applications. The adaptive broadband beamformer with tapped delay line （TDL） structure for nonuniform linear array （NLA） is designed according to the rule of minimizing the beamformer＇s output power while keeping the distortionless response （DR） in the direction of desired signal and keeping the constant beamwidth （CB） with the prescribed sidelobe level over the whole operating band. This kind of beamforming problem can be solved with the interior-point method after being converted to the form of standard second order cone programming （SOCP）. The computer simulations are presented which illustrate the effectiveness of our beamformer.
基金supported by the National Natural Science Foundation of China (Nos. 71061002 and 11071158)the Natural Science Foundation of Guangxi Province of China (Nos. 0832052 and 2010GXNSFB013047)
文摘Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming （SOCP） are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton （AHO） directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O（rln（εo/ε）） is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective.
基金Project supported by the National Natural Science Foundation of China (No. 10771026)the Foundation of Dalian University of Technology (Nos. MXDUT73008 and MXDUT98009)
文摘A vu-decomposition method for solving a second-order cone problem is presented in this paper. It is first transformed into a nonlinear programming problem. Then, the structure of the Clarke subdifferential corresponding to the penalty function and some results of itsvu-decomposition are given. Under a certain condition, a twice continuously differentiable trajectory is computed to produce a second-order expansion of the objective function. A conceptual algorithm for solving this problem with a superlinear convergence rate is given.
基金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.
基金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 Joint Foundation of the Ministry of Education of China(No.6141A02022340).
文摘An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a nonlinear optimal control problem,which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints.After convexification treatments and discretization,the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming(SOCP)problems,which can be readily solved by state-of-the-art Interior-Point Methods(IPMs).To mitigate the sensibility of the algorithm on the user-provided initial profile,a Two-Stage Sequential Convex Programming(TSSCP)method is presented in detail.Furthermore,numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem.The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.
文摘智能软开关(soft normally open point, SNOP)凭借其灵活的功率调节能力逐渐应用于配电网中。但由于大量分布式电源(distributed generation, DG)接入,SNOP受到线路容量的限制,调节能力有限。为发挥其最大调节能力,文中提出适用于配电系统的SNOP对线路有功功率裕度调节灵敏度的定义,将其作为SNOP调节能力的评价指标,由此建立SNOP的选址优化模型。在此基础上,引入系统节点电压裕度以及线路功率裕度2个安全评价指标,构建以综合运行裕度最大为目标函数的配电网运行优化模型。将上述模型转化为二阶锥模型,通过MATLAB工具实现该问题的有效求解。最后,通过改进的IEEE 33节点算例对所提模型与求解方法进行验证,进一步表明了所提选址方法能够发挥SNOP的最大调节作用,优化控制策略可以实现配电网安全经济运行。
文摘针对基于能量管理的高速飞行器轨迹优化问题,考虑发动机工作过程对飞行状态严格的约束要求,提出一种基于凸优化的高速飞行器轨迹优化方法。即认为发动机燃油耗尽关机、飞行器动力一定的前提下,求解射程最远的优化轨迹以满足高速长远距离飞行任务需求。首先,在飞行器纵向动力学质点模型基础上进行简化处理,得到以飞行器质量为变量的四阶动力学方程,将考虑发动机工作约束的飞行器射程的最优轨迹求解问题,转化为一系列非线性规划问题;接着,将非线性规划问题转化为二阶锥规划(Second Order Cone Program,SOCP)问题,对动力学方程以及不等式约束线性化、离散化处理后,采用原对偶内点法求解,获得最优轨迹;最后,仿真验证了所提优化方法在发动机工作约束范围内,解得了射程最大的最优轨迹。
文摘针对配电网中分布式电源渗透率提高导致的潮流倒送、电压波动和供电能力不足等问题,文中提出一种基于储能特性的三端智能软开关(three-terminal intelligent soft open point, E-SOP)有源配电台区优化控制策略。首先,深入分析E-SOP的拓扑,建立其数学模型,为后续优化控制奠定基础。其次,提出一种基于电压-功率灵敏度的ESOP选址规划模型,以确定其最佳安装位置。在此基础上,构建以综合费用和电压偏差最小化为目标的优化模型,实现E-SOP容量配置。该模型通过锥松弛技术转换为二阶锥规划模型,并采用粒子群算法求解。最后,通过IEEE33节点柔性互联系统的仿真验证所提策略的有效性,并在IEEE 69节点系统中进一步验证其适用性和优越性。结果表明,相比传统无E-SOP互联系统,所提策略可使电压偏差降低2.24%,日均损耗减少50.41%,综合成本下降21.74%,适用于不同规模的配电系统。
文摘为解决配网对新能源承载力不足的问题,文中提出了一种考虑软开关(Soft Open Point,SOP)和负荷主动电压控制的联合规划模型和求解方法。建立应用于配电网规划的SOP数学模型,分别针对多项式形式和指数形式的负荷电压特性建立线性化模型。以分布式新能源承载力、投资成本和运行成本为目标,建立有源配网两阶段随机二阶锥规划模型,对SOP、电容器组以及分布式新能源等设备的选址定容及其日内运行策略做出决策。考虑新能源、负荷和能源价格的不确定性,提出了基于K均值的场景聚类方法,提出了基于信赖域法的Benders分解算法来求解所提模型。通过改进51节点系统验证了所提模型的有效性和正确性,并分析了SOP与主动电压控制对新能源承载力的影响。
