A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality co...A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems.展开更多
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 letter, we construct a kind of new Darboux transformation for the （1＋1）-dimensional higher-order Broer-Kaup （HBK） system with the help of a gauge transformation of a spectral problem. By applying this new...In this letter, we construct a kind of new Darboux transformation for the （1＋1）-dimensional higher-order Broer-Kaup （HBK） system with the help of a gauge transformation of a spectral problem. By applying this new Darboux transformation, some new soliton-like solutions of the （1＋1）-dimensional HBK system are obtained.展开更多
Univariate Gonarov polynomials arose from the Goncarov interpolation problem in numerical analysis.They provide a natural basis of polynomials for working with u-parking functions,which are integer sequences whose ord...Univariate Gonarov polynomials arose from the Goncarov interpolation problem in numerical analysis.They provide a natural basis of polynomials for working with u-parking functions,which are integer sequences whose order statistics are bounded by a given sequence u.In this paper,we study multivariate Goncarov polynomials,which form a basis of solutions for multivariate Goncarov interpolation problem.We present algebraic and analytic properties of multivariate Gonarov polynomials and establish a combinatorial relation with integer sequences.Explicitly,we prove that multivariate Goncarov polynomials enumerate k-tuples of integers sequences whose order statistics are bounded by certain weights along lattice paths in Nk.It leads to a higher-dimensional generalization of parking functions,for which many enumerative results can be derived from the theory of multivariate Goncarov polynomials.展开更多
基金Supported by the National Natural Science Foundation of China（20676117） the National Creative Research Groups Science Foundation of China（60421002）
文摘A comparison of arithmetic operations of two dynamic process optimization approaches called quasi-sequential approach and reduced Sequential Quadratic Programming(rSQP)simultaneous approach with respect to equality constrained optimization problems is presented.Through the detail comparison of arithmetic operations,it is concluded that the average iteration number within differential algebraic equations(DAEs)integration of quasi-sequential approach could be regarded as a criterion.One formula is given to calculate the threshold value of average iteration number.If the average iteration number is less than the threshold value,quasi-sequential approach takes advantage of rSQP simultaneous approach which is more suitable contrarily.Two optimal control problems are given to demonstrate the usage of threshold value.For optimal control problems whose objective is to stay near desired operating point,the iteration number is usually small.Therefore,quasi-sequential approach seems more suitable for such problems.
基金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.
基金The project partially supported by the State Key Basic Pesearch Program of China under Grant No. 2004CB318000
文摘In this letter, we construct a kind of new Darboux transformation for the （1＋1）-dimensional higher-order Broer-Kaup （HBK） system with the help of a gauge transformation of a spectral problem. By applying this new Darboux transformation, some new soliton-like solutions of the （1＋1）-dimensional HBK system are obtained.
基金supported by the National Priority Research Program (Grant No. #[5101-1-025]) from the Qatar National Research Fund (a member of Qatar Foundation)
文摘Univariate Gonarov polynomials arose from the Goncarov interpolation problem in numerical analysis.They provide a natural basis of polynomials for working with u-parking functions,which are integer sequences whose order statistics are bounded by a given sequence u.In this paper,we study multivariate Goncarov polynomials,which form a basis of solutions for multivariate Goncarov interpolation problem.We present algebraic and analytic properties of multivariate Gonarov polynomials and establish a combinatorial relation with integer sequences.Explicitly,we prove that multivariate Goncarov polynomials enumerate k-tuples of integers sequences whose order statistics are bounded by certain weights along lattice paths in Nk.It leads to a higher-dimensional generalization of parking functions,for which many enumerative results can be derived from the theory of multivariate Goncarov polynomials.
