Active set method and gradient projection method are curre nt ly the main approaches for linearly constrained convex programming. Interior-po int method is one of the most effective choices for linear programming. In ...Active set method and gradient projection method are curre nt ly the main approaches for linearly constrained convex programming. Interior-po int method is one of the most effective choices for linear programming. In the p aper a predictor-corrector interior-point algorithm for linearly constrained c onvex programming under the predictor-corrector motivation was proposed. In eac h iteration, the algorithm first performs a predictor-step to reduce the dualit y gap and then a corrector-step to keep the points close to the central traject ory. Computations in the algorithm only require that the initial iterate be nonn egative while feasibility or strict feasibility is not required. It is proved th at the algorithm is equivalent to a level-1 perturbed composite Newton method. Numerical experiments on twenty-six standard test problems are made. The result s show that the proposed algorithm is stable and robust.展开更多
The electricity-hydrogen integrated energy system(EH-IES)enables synergistic operation of electricity,heat,and hydrogen subsystems,supporting renewable energy integration and efficient multi-energy utilization in futu...The electricity-hydrogen integrated energy system(EH-IES)enables synergistic operation of electricity,heat,and hydrogen subsystems,supporting renewable energy integration and efficient multi-energy utilization in future low carbon societies.However,uncertainties from renewable energy and load variability threaten system safety and economy.Conventional chance-constrained programming(CCP)ensures reliable operation by limiting risk.However,increasing source-load uncertainties that can render CCP models infeasible and exacerbate operational risks.To address this,this paper proposes a risk-adjustable chance-constrained goal programming(RACCGP)model,integrating CCP and goal programming to balance risk and cost based on system risk assessment.An intelligent nonlinear goal programming method based on the state transition algorithm(STA)is developed,along with an improved discretized step transformation,to handle model nonlinearity and enhance computational efficiency.Experimental results show that the proposed model reduces costs while controlling risk compared to traditional CCP,and the solution method outperforms average sample sampling in efficiency and solution quality.展开更多
Time-differences-of-arrival （TDOA） and gain-ratios-of- arrival （GROA） measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares （CWL...Time-differences-of-arrival （TDOA） and gain-ratios-of- arrival （GROA） measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares （CWLS） estimator is presented. Due to the nonconvex nature of the CWLS problem, it is difficult to obtain its globally optimal solution. However, according to the semidefinite relaxation, the CWLS problem can be relaxed as a convex semidefinite programming problem （SDP）, which can be solved by using modern convex optimization algorithms. Moreover, this relaxation can be proved to be tight, i.e., the SDP solves the relaxed CWLS problem, and this hence guarantees the good per- formance of the proposed method. Furthermore, this method is extended to solve the localization problem with sensor position errors. Simulation results corroborate the theoretical results and the good performance of the proposed method.展开更多
文摘Active set method and gradient projection method are curre nt ly the main approaches for linearly constrained convex programming. Interior-po int method is one of the most effective choices for linear programming. In the p aper a predictor-corrector interior-point algorithm for linearly constrained c onvex programming under the predictor-corrector motivation was proposed. In eac h iteration, the algorithm first performs a predictor-step to reduce the dualit y gap and then a corrector-step to keep the points close to the central traject ory. Computations in the algorithm only require that the initial iterate be nonn egative while feasibility or strict feasibility is not required. It is proved th at the algorithm is equivalent to a level-1 perturbed composite Newton method. Numerical experiments on twenty-six standard test problems are made. The result s show that the proposed algorithm is stable and robust.
基金Project(2022YFC2904502)supported by the National Key Research and Development Program of ChinaProject(62273357)supported by the National Natural Science Foundation of China。
文摘The electricity-hydrogen integrated energy system(EH-IES)enables synergistic operation of electricity,heat,and hydrogen subsystems,supporting renewable energy integration and efficient multi-energy utilization in future low carbon societies.However,uncertainties from renewable energy and load variability threaten system safety and economy.Conventional chance-constrained programming(CCP)ensures reliable operation by limiting risk.However,increasing source-load uncertainties that can render CCP models infeasible and exacerbate operational risks.To address this,this paper proposes a risk-adjustable chance-constrained goal programming(RACCGP)model,integrating CCP and goal programming to balance risk and cost based on system risk assessment.An intelligent nonlinear goal programming method based on the state transition algorithm(STA)is developed,along with an improved discretized step transformation,to handle model nonlinearity and enhance computational efficiency.Experimental results show that the proposed model reduces costs while controlling risk compared to traditional CCP,and the solution method outperforms average sample sampling in efficiency and solution quality.
基金supported by the National Natural Science Foundation of China(61201282)the Science and Technology on Communication Information Security Control Laboratory Foundation(9140C130304120C13064)
文摘Time-differences-of-arrival （TDOA） and gain-ratios-of- arrival （GROA） measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares （CWLS） estimator is presented. Due to the nonconvex nature of the CWLS problem, it is difficult to obtain its globally optimal solution. However, according to the semidefinite relaxation, the CWLS problem can be relaxed as a convex semidefinite programming problem （SDP）, which can be solved by using modern convex optimization algorithms. Moreover, this relaxation can be proved to be tight, i.e., the SDP solves the relaxed CWLS problem, and this hence guarantees the good per- formance of the proposed method. Furthermore, this method is extended to solve the localization problem with sensor position errors. Simulation results corroborate the theoretical results and the good performance of the proposed method.
