This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one c...This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one corrector step after each predictor step, where Step 2 is a predictor step and Step 4 is a corrector step in the algorithm. In the algorithm, the predictor step decreases the dual gap as much as possible in a wider neighborhood of the central path and the corrector step draws iteration points back to a narrower neighborhood and make a reduction for the dual gap. It is shown that the algorithm has O（√nL） iteration complexity which is the best result for convex quadratic programming so far.展开更多
With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the m...With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient.展开更多
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above...In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.展开更多
The real-time capability of integrated flight/propulsion optimal control （IFPOC） is studied. An appli- cation is proposed for IFPOC by combining the onboard hybrid aero-engine model with sequential quadratic pro- gr...The real-time capability of integrated flight/propulsion optimal control （IFPOC） is studied. An appli- cation is proposed for IFPOC by combining the onboard hybrid aero-engine model with sequential quadratic pro- gramming （SQP）. Firstly, a steady-state hybrid aero-engine model is designed in the whole flight envelope with a dramatic enhancement of real-time capability. Secondly, the aero-engine performance seeking control including the maximum thrust mode and the minimum fuel-consumption mode is performed by SQP. Finally, digital simu- lations for cruise and accelerating flight are carried out. Results show that the proposed method improves real- time capability considerably with satisfactory effectiveness of optimization.展开更多
A localization algorithm using distance and angle information is proposed in wireless sensor networks. Assuming that node axial orientations are unknown, all angles are measured to calculate the angle differences betw...A localization algorithm using distance and angle information is proposed in wireless sensor networks. Assuming that node axial orientations are unknown, all angles are measured to calculate the angle differences between two nodes viewed by the third one. Then, localization problems are formulated as convex optimization ones and all geometric relationships among different nodes in the communication range are transformed into linear or quadratic constraints. If all measurements are accurate, the localization problem can be formulated as linear programming （LP）. Otherwise, by incorporating auxiliary variables, it can be regarded as quadratic programming （QP）. Simulations show the effectiveness of the proposed algorithm.展开更多
This paper proposes a novel exemplar- based method for reducing noise in computed tomography （CT） images. In the proposed method, denoising is performed on each block with the help of a given database of standard im...This paper proposes a novel exemplar- based method for reducing noise in computed tomography （CT） images. In the proposed method, denoising is performed on each block with the help of a given database of standard image blocks. For each noisy block, its denoised version is the best sparse positive linear combination of the blocks in the database. We formulate the problem as a constrained optimization problem such that the solution is the denoised block. Experimental results demonstrate the good performance of the proposed method over current state-of-the-art denoising methods, in terms of both objective and subjective evaluations.展开更多
A dynamic programming-sequential quadratic programming(DP-SQP)combined algorithm is proposed to address the problem that the traditional continuous control method has high computational complexity and is easy to fall ...A dynamic programming-sequential quadratic programming(DP-SQP)combined algorithm is proposed to address the problem that the traditional continuous control method has high computational complexity and is easy to fall into local optimal solution.To solve the globally optimal control law sequence,we use the dynamic programming algorithm to discretize the separation control decision-making process into a series of sub-stages based on the time characteristics of the separation allocation model,and recursion from the end stage to the initial stage.The sequential quadratic programming algorithm is then used to solve the optimal return function and the optimal control law for each sub-stage.Comparative simulations of the combined algorithm and the traditional algorithm are designed to validate the superiority of the combined algorithm.Aircraft-following and cross-conflict simulation examples are created to demonstrate the combined algorithm’s adaptability to various conflict scenarios.The simulation results demonstrate the separation deploy strategy’s effectiveness,efficiency,and adaptability.展开更多
When programming the daily generation strategies, power plants consider not only the competitive bids in spot market and the original purchase contracts with distribution companies or users, but also the spinning rese...When programming the daily generation strategies, power plants consider not only the competitive bids in spot market and the original purchase contracts with distribution companies or users, but also the spinning reserve. Aiming at this goal, the paper puts forward a daily generating model, which is a nonlinear programming model containing integral and continous variables, to coordinate the power volumes of competitive bids, contract and the spinning reserve of power plants and thus to maximize their profits. Then, the model is simplified to ease its solving process, and solved by priority ranking method based on efficiency and quadratic programming. The simulation result of a case study shows that the proposed scheme is reasonable and practicable.展开更多
Focused energy delivery(FED) is a technique that can precisely bring energy to the specific region,which arouses wide attention in precision electronic warfare(PREW).This paper first proposes a joint optimization mode...Focused energy delivery(FED) is a technique that can precisely bring energy to the specific region,which arouses wide attention in precision electronic warfare(PREW).This paper first proposes a joint optimization model with respect to the locations of the array and the transmitted signals to improve the performance of FED.As the problem is nonconvex and NP-hard,particle swarm optimization(PSO) is adopted to solve the locations of the array,while designing the transmitted signals under a feasible array is considered as a unimodular quadratic program(UQP) subproblem to calculate the fitness criterion of PSO.In the PSO-UQP framework established,two methods are presented for the UQP subproblem,which are more efficient and more accurate respectively than previous works.Furthermore,a threshold value is set in the framework to determine which method to adopt to take full advantages of the methods above.Meanwhile,we obtain the maximum localization error that FED can tolerate,which is significant for implementing FED in practice.Simulation results are provided to demonstrate the effectiveness of the joint optimization algorithm,and the correctness of the maximum localization error derived.展开更多
This article discusses feasibility conditions in mathematical programs with equilibrium constraints （MPECs）. The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors sho...This article discusses feasibility conditions in mathematical programs with equilibrium constraints （MPECs）. The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors show that the two feasibility conditions are different from the feasibility condition in [2, 3], and show that the sufficient condition in [3] is stronger than that in [2].展开更多
Fluid catalytic cracking(FCC)is a vitally important refinery process.The fractionation,absorption,and stabilization system in the FCC process is a significant way to obtain key products,and its parameters will directl...Fluid catalytic cracking(FCC)is a vitally important refinery process.The fractionation,absorption,and stabilization system in the FCC process is a significant way to obtain key products,and its parameters will directly affect the quality of the products.In this work,using industrial data from an actual FCC process,a model of the FCC fractionation,absorption,and stabilization system was developed using process simulation software.The sequence quadratic program algorithm was then used to identify the parameters of each tower,increasing the accuracy of the simulation results.Next,using this improved model,a sensitivity analysis was performed to examine the effects of different operating conditions.The pattern-search method was then used to optimize the operating parameters of the system.The results showed that the optimized model has good prediction accuracy,and using the model,it was found that changing the operation parameters could result in a 1.84%improvement in economic benefits.As such,the developed model was demonstrated to be usefully applicable to the optimization of the process operation of an FCC fractionation,absorption,and stabilization system.展开更多
基金Project supported by the National Science Foundation of China (60574071) the Foundation for University Key Teacher by the Ministry of Education.
文摘This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one corrector step after each predictor step, where Step 2 is a predictor step and Step 4 is a corrector step in the algorithm. In the algorithm, the predictor step decreases the dual gap as much as possible in a wider neighborhood of the central path and the corrector step draws iteration points back to a narrower neighborhood and make a reduction for the dual gap. It is shown that the algorithm has O（√nL） iteration complexity which is the best result for convex quadratic programming so far.
基金Supported by Science and Technology Foundation of China University of Mining & Technology
文摘With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient.
文摘In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.
基金Supported by the Aeronautical Science Foundation of China(2010ZB52011)the Funding of Jiangsu Innovation Program for Graduate Education(CXLX11-0213)the Nanjing University of Aeronautics and Astronautics Research Funding(NS2010055)~~
文摘The real-time capability of integrated flight/propulsion optimal control （IFPOC） is studied. An appli- cation is proposed for IFPOC by combining the onboard hybrid aero-engine model with sequential quadratic pro- gramming （SQP）. Firstly, a steady-state hybrid aero-engine model is designed in the whole flight envelope with a dramatic enhancement of real-time capability. Secondly, the aero-engine performance seeking control including the maximum thrust mode and the minimum fuel-consumption mode is performed by SQP. Finally, digital simu- lations for cruise and accelerating flight are carried out. Results show that the proposed method improves real- time capability considerably with satisfactory effectiveness of optimization.
文摘A localization algorithm using distance and angle information is proposed in wireless sensor networks. Assuming that node axial orientations are unknown, all angles are measured to calculate the angle differences between two nodes viewed by the third one. Then, localization problems are formulated as convex optimization ones and all geometric relationships among different nodes in the communication range are transformed into linear or quadratic constraints. If all measurements are accurate, the localization problem can be formulated as linear programming （LP）. Otherwise, by incorporating auxiliary variables, it can be regarded as quadratic programming （QP）. Simulations show the effectiveness of the proposed algorithm.
文摘This paper proposes a novel exemplar- based method for reducing noise in computed tomography （CT） images. In the proposed method, denoising is performed on each block with the help of a given database of standard image blocks. For each noisy block, its denoised version is the best sparse positive linear combination of the blocks in the database. We formulate the problem as a constrained optimization problem such that the solution is the denoised block. Experimental results demonstrate the good performance of the proposed method over current state-of-the-art denoising methods, in terms of both objective and subjective evaluations.
基金supported in part by the National Natural Science Foundation of China(Nos.61773202,52072174)the Foundation of National Defense Science and Technology Key Laboratory of Avionics System Integrated Technology of China Institute of Aeronautical Radio Electronics(No.6142505180407)+1 种基金the Open Fund for Civil Aviation General Aviation Operation Key Laboratory of China Civil Aviation Management Cadre Institute(No.CAMICKFJJ-2019-04)the National key R&D plan(No.2021YFB1600500)。
文摘A dynamic programming-sequential quadratic programming(DP-SQP)combined algorithm is proposed to address the problem that the traditional continuous control method has high computational complexity and is easy to fall into local optimal solution.To solve the globally optimal control law sequence,we use the dynamic programming algorithm to discretize the separation control decision-making process into a series of sub-stages based on the time characteristics of the separation allocation model,and recursion from the end stage to the initial stage.The sequential quadratic programming algorithm is then used to solve the optimal return function and the optimal control law for each sub-stage.Comparative simulations of the combined algorithm and the traditional algorithm are designed to validate the superiority of the combined algorithm.Aircraft-following and cross-conflict simulation examples are created to demonstrate the combined algorithm’s adaptability to various conflict scenarios.The simulation results demonstrate the separation deploy strategy’s effectiveness,efficiency,and adaptability.
文摘When programming the daily generation strategies, power plants consider not only the competitive bids in spot market and the original purchase contracts with distribution companies or users, but also the spinning reserve. Aiming at this goal, the paper puts forward a daily generating model, which is a nonlinear programming model containing integral and continous variables, to coordinate the power volumes of competitive bids, contract and the spinning reserve of power plants and thus to maximize their profits. Then, the model is simplified to ease its solving process, and solved by priority ranking method based on efficiency and quadratic programming. The simulation result of a case study shows that the proposed scheme is reasonable and practicable.
基金Anhui Provincial Natural Science Foundation(Project for Youth:1908085QF252)Research Program of National University of Defense Technology(ZK19-10)。
文摘Focused energy delivery(FED) is a technique that can precisely bring energy to the specific region,which arouses wide attention in precision electronic warfare(PREW).This paper first proposes a joint optimization model with respect to the locations of the array and the transmitted signals to improve the performance of FED.As the problem is nonconvex and NP-hard,particle swarm optimization(PSO) is adopted to solve the locations of the array,while designing the transmitted signals under a feasible array is considered as a unimodular quadratic program(UQP) subproblem to calculate the fitness criterion of PSO.In the PSO-UQP framework established,two methods are presented for the UQP subproblem,which are more efficient and more accurate respectively than previous works.Furthermore,a threshold value is set in the framework to determine which method to adopt to take full advantages of the methods above.Meanwhile,we obtain the maximum localization error that FED can tolerate,which is significant for implementing FED in practice.Simulation results are provided to demonstrate the effectiveness of the joint optimization algorithm,and the correctness of the maximum localization error derived.
基金the National Natural Science Foundation of China(70271019)
文摘This article discusses feasibility conditions in mathematical programs with equilibrium constraints （MPECs）. The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors show that the two feasibility conditions are different from the feasibility condition in [2, 3], and show that the sufficient condition in [3] is stronger than that in [2].
基金supported by the National Key Research&Development Program-Intergovernmental International Science and Technology Innovation Cooperation Project (Grant No.2021YFE0112800)National Natural Science Foundation of China (Grant Nos.61973124+2 种基金61873093)the SINOPEC Research Program (Grant No.119030-2)Shanghai AI Lab
文摘Fluid catalytic cracking(FCC)is a vitally important refinery process.The fractionation,absorption,and stabilization system in the FCC process is a significant way to obtain key products,and its parameters will directly affect the quality of the products.In this work,using industrial data from an actual FCC process,a model of the FCC fractionation,absorption,and stabilization system was developed using process simulation software.The sequence quadratic program algorithm was then used to identify the parameters of each tower,increasing the accuracy of the simulation results.Next,using this improved model,a sensitivity analysis was performed to examine the effects of different operating conditions.The pattern-search method was then used to optimize the operating parameters of the system.The results showed that the optimized model has good prediction accuracy,and using the model,it was found that changing the operation parameters could result in a 1.84%improvement in economic benefits.As such,the developed model was demonstrated to be usefully applicable to the optimization of the process operation of an FCC fractionation,absorption,and stabilization system.
