The finite-dimensional variational inequality problem (VIP) has been studied extensively in the literature because of its successful applications in many fields such as economics, transportation, regional science and ...The finite-dimensional variational inequality problem (VIP) has been studied extensively in the literature because of its successful applications in many fields such as economics, transportation, regional science and operations research. Barker and Pang[1] have given an excellent survey of theories, methods and applications of VIPs.展开更多
In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex n...In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.展开更多
Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the ef...Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the effective model and algorithm. This paper examines the decoupled conditions that affect the solution optimality to this problem. It proposes an effective model and solution method. Based on the look-ahead technique, it finds the number of time intervals to guarantee the solution optimality. Next, an efficient technique for finding the optimal solution via the interior point methods is described. Test cases, which include dispatching six units over 5 time intervals on the IEEE 30 test system with line flows and ramp constraints are presented. Results indicate that the computational effort as measured by iteration counts or execution time varies only modestly with the problem size.展开更多
A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal proble...A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal problem via incorporating an auxiliary variable is constructed. A combined approach of logarithm barrier and quadratic penalty function is proposed to solve the problem. Based on Newton＇s method, the global convergence of interior point and line search algorithm is proven. Only a finite number of iterations is required to reach an approximate optimal solution. Numerical tests are given to show the effectiveness of the method.展开更多
In this paper,we are mainly devoted to solving fixed point problems in more general nonconvex sets via an interior point homotopy method.Under suitable conditions,a constructive proof is given to prove the existence o...In this paper,we are mainly devoted to solving fixed point problems in more general nonconvex sets via an interior point homotopy method.Under suitable conditions,a constructive proof is given to prove the existence of fixed points,which can lead to an implementable globally convergent algorithm.展开更多
The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point wit...The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane （IP/CP） method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender＇s decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm.展开更多
Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation ...Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation model between wavefront error and degree of movable lens freedom is established.Converting over-determined system to underdetermined system,the compensation is solved by Interior Point Method(IPM).The presented method is compared with direct solve the over-determined system.Then,other algorithm GA,EA and PS is compared with IPM.Simulation and experimental results show that the presented compensation method can obtained compensation with less residuals compared with direct solve the over-determined system.Also,the presented compensation method can reduce computation time and obtain results with less residuals compare with AGA,EA and PS.Moreover,after compensation,RMS of wavefront error of the experimental lithography projection objective decrease from 56.05 nm to 17.88 nm.展开更多
In this paper, an unbounded condition is presented, under which we are able to utilize the interior point homotopy method to solve the Brouwer fixed point problem on unbounded sets. Two numerical examples in R3 are pr...In this paper, an unbounded condition is presented, under which we are able to utilize the interior point homotopy method to solve the Brouwer fixed point problem on unbounded sets. Two numerical examples in R3 are presented to illustrate the results in this paper.展开更多
Low earth orbit(LEO) satellite communications can provide ubiquitous and reliable services,making it an essential part of the Internet of Everything network. Beam hopping(BH) is an emerging technology for effectively ...Low earth orbit(LEO) satellite communications can provide ubiquitous and reliable services,making it an essential part of the Internet of Everything network. Beam hopping(BH) is an emerging technology for effectively addressing the issue of low resource utilization caused by the non-uniform spatio-temporal distribution of traffic demands. However, how to allocate multi-dimensional resources in a timely and efficient way for the highly dynamic LEO satellite systems remains a challenge. This paper proposes a joint beam scheduling and power optimization beam hopping(JBSPO-BH) algorithm considering the differences in the geographic distribution of sink nodes. The JBSPO-BH algorithm decouples the original problem into two sub-problems. The beam scheduling problem is modelled as a potential game,and the Nash equilibrium(NE) point is obtained as the beam scheduling strategy. Moreover, the penalty function interior point method is applied to optimize the power allocation. Simulation results show that the JBSPO-BH algorithm has low time complexity and fast convergence and achieves better performance both in throughput and fairness. Compared with greedybased BH, greedy-based BH with the power optimization, round-robin BH, Max-SINR BH and satellite resource allocation algorithm, the throughput of the proposed algorithm is improved by 44.99%, 20.79%,156.06%, 15.39% and 8.17%, respectively.展开更多
This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimizat...This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimization problems into a set of single-objective optimization problems.For this set of problems,parametric perturbed KKT conditions are derived.Subsequently,an interior point technique is developed to solve the parametric perturbed KKT conditions.A differentiable merit function is also proposed whose stationary point satisfies the KKT conditions.Under some mild assumptions,the proposed algorithm is shown to be globally convergent.Numerical results of unconstrained and constrained multi-objective optimization test problems are presented.Also,three performance metrics(modified generational distance,hypervolume,inverted generational distance)are used on some test problems to investigate the efficiency of the proposed algorithm.We also compare the results of the proposed algorithm with the results of some other existing popular methods.展开更多
In order to reduce the intrinsic interference of the filter bank multicarrier-quadrature amplitude modulation(FBMC-QAM)system,a novel filter optimization scheme based on discrete prolate spheroidal sequences(DPSS)is p...In order to reduce the intrinsic interference of the filter bank multicarrier-quadrature amplitude modulation(FBMC-QAM)system,a novel filter optimization scheme based on discrete prolate spheroidal sequences(DPSS)is proposed.Firstly,a prototype filter function based on DPSS is designed,since the eigenvalue can be used as an indicator of the energy concentration of DPSS,so a threshold is set,and the sequence with the most concentrated energy is selected under the threshold,that is,the sequence with the eigenvalue higher than the threshold,and the prototype filter function is rewritten as a weighted sum function of multiple eigenvectors.Under the energy constraints of the filter,the relationship between the eigenvectors and the intrinsic interference function is established,and the function problem is transformed into an optimization problem for the weighted coefficients.Through the interior point method,the most suitable weight is found to obtain the minimum intrinsic interference result.Theoretical analysis and simulation results show that compared with the prototype filters such as Type1 and CaseC,the DPSS filter applying the proposed optimization algorithm can effectively suppress the intrinsic interference of the system and obtain a better bit error rate(BER)performance.展开更多
It is well established that Nash equilibrium exists within the framework of mixed strategies in strategic-form non-cooperative games. However, finding the Nash equilibrium generally belongs to the class of problems kn...It is well established that Nash equilibrium exists within the framework of mixed strategies in strategic-form non-cooperative games. However, finding the Nash equilibrium generally belongs to the class of problems known as PPAD (Polynomial Parity Argument on Directed graphs), for which no polynomial-time solution methods are known, even for two-player games. This paper demonstrates that in fixed-sum two-player games (including zero-sum games), the Nash equilibrium forms a convex set, and has a unique expected payoff. Furthermore, these equilibria are Pareto optimal. Additionally, it is shown that the Nash equilibrium of fixed-sum two-player games can theoretically be found in polynomial time using the principal-dual interior point method, a solution method of linear programming.展开更多
In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization（SDO） problems. The proposed algorithm is based on a new kernel fun...In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization（SDO） problems. The proposed algorithm is based on a new kernel function which differs from the existing kernel functions in which it has a double barrier term. With this function we define a new search direction and also a new proximity function for analyzing its complexity. We show that if q1 〉 q2 〉 1, the algorithm has O（（q1 ＋ 1） nq1＋1/2（q1-q2）logn/ε）and O（（q1 ＋ 1）2（q1-q2）^3q1-2q2＋1√n logn/c） complexity results for large- and small-update methods, respectively.展开更多
In this paper,we introduce for the first time a new eligible kernel function with a hyperbolic barrier term for semidefinite programming(SDP).This add a new type of functions to the class of eligible kernel functions....In this paper,we introduce for the first time a new eligible kernel function with a hyperbolic barrier term for semidefinite programming(SDP).This add a new type of functions to the class of eligible kernel functions.We prove that the interior-point algorithm based on the new kernel function meets O(n3/4 logε/n)iterations as the worst case complexity bound for the large-update method.This coincides with the complexity bound obtained by the first kernel function with a trigonometric barrier term proposed by El Ghami et al.in2012,and improves with a factor n(1/4)the obtained iteration bound based on the classic kernel function.We present some numerical simulations which show the effectiveness of the algorithm developed in this paper.展开更多
This article describes numerical simulation of gas pipeline network operation using high-accuracy computational fluid dynamics (CFD) simulators of the modes of gas mixture transmission through long, multi-line pipelin...This article describes numerical simulation of gas pipeline network operation using high-accuracy computational fluid dynamics (CFD) simulators of the modes of gas mixture transmission through long, multi-line pipeline systems (CFD-simulator). The approach used in CFD-simulators for modeling gas mixture transmission through long, branched, multi-section pipelines is based on tailoring the full system of fluid dynamics equations to conditions of unsteady, non-isothermal processes of the gas mixture flow. Identification, in a CFD-simulator, of safe parameters for gas transmission through compressor stations amounts to finding the interior points of admissible sets described by systems of nonlinear algebraic equalities and inequalities. Such systems of equalities and inequalities comprise a formal statement of technological, design, operational and other constraints to which operation of the network equipment is subject. To illustrate the practicability of the method of numerical simulation of a gas transmission network, we compare computation results and gas flow parameters measured on-site at the gas transmission enter-prise.展开更多
An approach for parameter estimation of proportional-integral-derivative(PID) control system using a new nonlinear programming(NLP) algorithm was proposed.SQP/IIPM algorithm is a sequential quadratic programming(SQP) ...An approach for parameter estimation of proportional-integral-derivative(PID) control system using a new nonlinear programming(NLP) algorithm was proposed.SQP/IIPM algorithm is a sequential quadratic programming(SQP) based algorithm that derives its search directions by solving quadratic programming(QP) subproblems via an infeasible interior point method(IIPM) and evaluates step length adaptively via a simple line search and/or a quadratic search algorithm depending on the termination of the IIPM solver.The task of tuning PI/PID parameters for the first-and second-order systems was modeled as constrained NLP problem. SQP/IIPM algorithm was applied to determining the optimum parameters for the PI/PID control systems.To assess the performance of the proposed method,a Matlab simulation of PID controller tuning was conducted to compare the proposed SQP/IIPM algorithm with the gain and phase margin(GPM) method and Ziegler-Nichols(ZN) method.The results reveal that,for both step and impulse response tests,the PI/PID controller using SQP/IIPM optimization algorithm consistently reduce rise time,settling-time and remarkably lower overshoot compared to GPM and ZN methods,and the proposed method improves the robustness and effectiveness of numerical optimization of PID control systems.展开更多
In this paper,an integrated guidance and control approach is presented to improve the performance of the missile interception.The approach includes damping augmented system with attitude rate feedback to decrease the ...In this paper,an integrated guidance and control approach is presented to improve the performance of the missile interception.The approach includes damping augmented system with attitude rate feedback to decrease the oscillation during the homing phase for missiles with low damping.In addition,physical constraints,which can affect the performance of the missile interception,such as acceleration limit,seeker’s look angle,and look angle rate constraints are considered.The integrated guidance and control problem is formulated as a convex quadratic optimization problem with equality and inequality constraints,and the solution is obtained by a primal–dual interior point method.The performance of the proposed method is verified through several numerical examples.展开更多
With the rapid development of the wind generation,uncertainties of random wind and load bring some inevitable impacts on the security of power system. Once the uncertainty causes line power to exceed its limit, line o...With the rapid development of the wind generation,uncertainties of random wind and load bring some inevitable impacts on the security of power system. Once the uncertainty causes line power to exceed its limit, line overload will occur. The paper presents the risk control of transmission line overload for windintegrated power systems. Firstly, a risk control model of line overload is proposed considering the uncertainties of loads,generator outputs and wind powers. The generation cost and security level of system associated with overload can be optimally controlled. Then path following interior point method is employed to carry out the optimal control. Finally the simulation is made on the modified IEEE-30 bus system. Results show that the risk of line overload is effectively reduced through the optimization of control variables.展开更多
基金The NNSF (10071031) of China and National 973 Project.
文摘The finite-dimensional variational inequality problem (VIP) has been studied extensively in the literature because of its successful applications in many fields such as economics, transportation, regional science and operations research. Barker and Pang[1] have given an excellent survey of theories, methods and applications of VIPs.
文摘In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.
文摘Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the effective model and algorithm. This paper examines the decoupled conditions that affect the solution optimality to this problem. It proposes an effective model and solution method. Based on the look-ahead technique, it finds the number of time intervals to guarantee the solution optimality. Next, an efficient technique for finding the optimal solution via the interior point methods is described. Test cases, which include dispatching six units over 5 time intervals on the IEEE 30 test system with line flows and ramp constraints are presented. Results indicate that the computational effort as measured by iteration counts or execution time varies only modestly with the problem size.
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Leading Academic Discipline Project (Grant Nos.J50101, S30104)
文摘A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal problem via incorporating an auxiliary variable is constructed. A combined approach of logarithm barrier and quadratic penalty function is proposed to solve the problem. Based on Newton＇s method, the global convergence of interior point and line search algorithm is proven. Only a finite number of iterations is required to reach an approximate optimal solution. Numerical tests are given to show the effectiveness of the method.
基金Supported by the NNSF of China(11026079)Supported by the Youth Backbone Teacher Foundation of Henan Province(173)
文摘In this paper,we are mainly devoted to solving fixed point problems in more general nonconvex sets via an interior point homotopy method.Under suitable conditions,a constructive proof is given to prove the existence of fixed points,which can lead to an implementable globally convergent algorithm.
文摘The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane （IP/CP） method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender＇s decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm.
文摘Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation model between wavefront error and degree of movable lens freedom is established.Converting over-determined system to underdetermined system,the compensation is solved by Interior Point Method(IPM).The presented method is compared with direct solve the over-determined system.Then,other algorithm GA,EA and PS is compared with IPM.Simulation and experimental results show that the presented compensation method can obtained compensation with less residuals compared with direct solve the over-determined system.Also,the presented compensation method can reduce computation time and obtain results with less residuals compare with AGA,EA and PS.Moreover,after compensation,RMS of wavefront error of the experimental lithography projection objective decrease from 56.05 nm to 17.88 nm.
文摘In this paper, an unbounded condition is presented, under which we are able to utilize the interior point homotopy method to solve the Brouwer fixed point problem on unbounded sets. Two numerical examples in R3 are presented to illustrate the results in this paper.
基金supported by the National Key Research and Development Program of China 2021YFB2900504, 2020YFB1807900。
文摘Low earth orbit(LEO) satellite communications can provide ubiquitous and reliable services,making it an essential part of the Internet of Everything network. Beam hopping(BH) is an emerging technology for effectively addressing the issue of low resource utilization caused by the non-uniform spatio-temporal distribution of traffic demands. However, how to allocate multi-dimensional resources in a timely and efficient way for the highly dynamic LEO satellite systems remains a challenge. This paper proposes a joint beam scheduling and power optimization beam hopping(JBSPO-BH) algorithm considering the differences in the geographic distribution of sink nodes. The JBSPO-BH algorithm decouples the original problem into two sub-problems. The beam scheduling problem is modelled as a potential game,and the Nash equilibrium(NE) point is obtained as the beam scheduling strategy. Moreover, the penalty function interior point method is applied to optimize the power allocation. Simulation results show that the JBSPO-BH algorithm has low time complexity and fast convergence and achieves better performance both in throughput and fairness. Compared with greedybased BH, greedy-based BH with the power optimization, round-robin BH, Max-SINR BH and satellite resource allocation algorithm, the throughput of the proposed algorithm is improved by 44.99%, 20.79%,156.06%, 15.39% and 8.17%, respectively.
基金financial support from Council of Scientific and Industrial Research,India through a research fellowship(File No.09/1217(0025)/2017-EMR-I)to carry out this research workDebdas Ghosh acknowledges the research grant(MTR/2021/000696)from SERB,India to carry out this research work.
文摘This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimization problems into a set of single-objective optimization problems.For this set of problems,parametric perturbed KKT conditions are derived.Subsequently,an interior point technique is developed to solve the parametric perturbed KKT conditions.A differentiable merit function is also proposed whose stationary point satisfies the KKT conditions.Under some mild assumptions,the proposed algorithm is shown to be globally convergent.Numerical results of unconstrained and constrained multi-objective optimization test problems are presented.Also,three performance metrics(modified generational distance,hypervolume,inverted generational distance)are used on some test problems to investigate the efficiency of the proposed algorithm.We also compare the results of the proposed algorithm with the results of some other existing popular methods.
基金the National Natural Science Foundation of China(No.61601296,61201244)the Science and Technology Innovation Action Plan Project of Shanghai Science and Technology Commission(No.20511103500)the Talent Program of Shanghai University of Engineering Science(No.2018RC43)。
文摘In order to reduce the intrinsic interference of the filter bank multicarrier-quadrature amplitude modulation(FBMC-QAM)system,a novel filter optimization scheme based on discrete prolate spheroidal sequences(DPSS)is proposed.Firstly,a prototype filter function based on DPSS is designed,since the eigenvalue can be used as an indicator of the energy concentration of DPSS,so a threshold is set,and the sequence with the most concentrated energy is selected under the threshold,that is,the sequence with the eigenvalue higher than the threshold,and the prototype filter function is rewritten as a weighted sum function of multiple eigenvectors.Under the energy constraints of the filter,the relationship between the eigenvectors and the intrinsic interference function is established,and the function problem is transformed into an optimization problem for the weighted coefficients.Through the interior point method,the most suitable weight is found to obtain the minimum intrinsic interference result.Theoretical analysis and simulation results show that compared with the prototype filters such as Type1 and CaseC,the DPSS filter applying the proposed optimization algorithm can effectively suppress the intrinsic interference of the system and obtain a better bit error rate(BER)performance.
文摘It is well established that Nash equilibrium exists within the framework of mixed strategies in strategic-form non-cooperative games. However, finding the Nash equilibrium generally belongs to the class of problems known as PPAD (Polynomial Parity Argument on Directed graphs), for which no polynomial-time solution methods are known, even for two-player games. This paper demonstrates that in fixed-sum two-player games (including zero-sum games), the Nash equilibrium forms a convex set, and has a unique expected payoff. Furthermore, these equilibria are Pareto optimal. Additionally, it is shown that the Nash equilibrium of fixed-sum two-player games can theoretically be found in polynomial time using the principal-dual interior point method, a solution method of linear programming.
文摘In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization（SDO） problems. The proposed algorithm is based on a new kernel function which differs from the existing kernel functions in which it has a double barrier term. With this function we define a new search direction and also a new proximity function for analyzing its complexity. We show that if q1 〉 q2 〉 1, the algorithm has O（（q1 ＋ 1） nq1＋1/2（q1-q2）logn/ε）and O（（q1 ＋ 1）2（q1-q2）^3q1-2q2＋1√n logn/c） complexity results for large- and small-update methods, respectively.
文摘In this paper,we introduce for the first time a new eligible kernel function with a hyperbolic barrier term for semidefinite programming(SDP).This add a new type of functions to the class of eligible kernel functions.We prove that the interior-point algorithm based on the new kernel function meets O(n3/4 logε/n)iterations as the worst case complexity bound for the large-update method.This coincides with the complexity bound obtained by the first kernel function with a trigonometric barrier term proposed by El Ghami et al.in2012,and improves with a factor n(1/4)the obtained iteration bound based on the classic kernel function.We present some numerical simulations which show the effectiveness of the algorithm developed in this paper.
文摘This article describes numerical simulation of gas pipeline network operation using high-accuracy computational fluid dynamics (CFD) simulators of the modes of gas mixture transmission through long, multi-line pipeline systems (CFD-simulator). The approach used in CFD-simulators for modeling gas mixture transmission through long, branched, multi-section pipelines is based on tailoring the full system of fluid dynamics equations to conditions of unsteady, non-isothermal processes of the gas mixture flow. Identification, in a CFD-simulator, of safe parameters for gas transmission through compressor stations amounts to finding the interior points of admissible sets described by systems of nonlinear algebraic equalities and inequalities. Such systems of equalities and inequalities comprise a formal statement of technological, design, operational and other constraints to which operation of the network equipment is subject. To illustrate the practicability of the method of numerical simulation of a gas transmission network, we compare computation results and gas flow parameters measured on-site at the gas transmission enter-prise.
基金Project(60874070) supported by the National Natural Science Foundation of ChinaProject(20070533131) supported by the National Research Foundation for the Doctoral Program of Higher Education of ChinaProject supported by the Scientific Research Foundation for the Returned Overseas Chinese Scholars,Ministry of Education of China
文摘An approach for parameter estimation of proportional-integral-derivative(PID) control system using a new nonlinear programming(NLP) algorithm was proposed.SQP/IIPM algorithm is a sequential quadratic programming(SQP) based algorithm that derives its search directions by solving quadratic programming(QP) subproblems via an infeasible interior point method(IIPM) and evaluates step length adaptively via a simple line search and/or a quadratic search algorithm depending on the termination of the IIPM solver.The task of tuning PI/PID parameters for the first-and second-order systems was modeled as constrained NLP problem. SQP/IIPM algorithm was applied to determining the optimum parameters for the PI/PID control systems.To assess the performance of the proposed method,a Matlab simulation of PID controller tuning was conducted to compare the proposed SQP/IIPM algorithm with the gain and phase margin(GPM) method and Ziegler-Nichols(ZN) method.The results reveal that,for both step and impulse response tests,the PI/PID controller using SQP/IIPM optimization algorithm consistently reduce rise time,settling-time and remarkably lower overshoot compared to GPM and ZN methods,and the proposed method improves the robustness and effectiveness of numerical optimization of PID control systems.
文摘In this paper,an integrated guidance and control approach is presented to improve the performance of the missile interception.The approach includes damping augmented system with attitude rate feedback to decrease the oscillation during the homing phase for missiles with low damping.In addition,physical constraints,which can affect the performance of the missile interception,such as acceleration limit,seeker’s look angle,and look angle rate constraints are considered.The integrated guidance and control problem is formulated as a convex quadratic optimization problem with equality and inequality constraints,and the solution is obtained by a primal–dual interior point method.The performance of the proposed method is verified through several numerical examples.
基金National Natural Science Foundations of China(Nos.51007052,71201097)Natural Science Foundation of Shanghai,China(No.14ZR1415300)
文摘With the rapid development of the wind generation,uncertainties of random wind and load bring some inevitable impacts on the security of power system. Once the uncertainty causes line power to exceed its limit, line overload will occur. The paper presents the risk control of transmission line overload for windintegrated power systems. Firstly, a risk control model of line overload is proposed considering the uncertainties of loads,generator outputs and wind powers. The generation cost and security level of system associated with overload can be optimally controlled. Then path following interior point method is employed to carry out the optimal control. Finally the simulation is made on the modified IEEE-30 bus system. Results show that the risk of line overload is effectively reduced through the optimization of control variables.
