This paper presents a simple and systematic approach to design second order sliding mode controller for buck converters.The second order sliding mode control(SOSMC)based on twisting algorithm has been implemented to c...This paper presents a simple and systematic approach to design second order sliding mode controller for buck converters.The second order sliding mode control(SOSMC)based on twisting algorithm has been implemented to control buck switch mode converter.The idea behind this strategy is to suppress chattering and maintain robustness and finite time convergence properties of the output voltage error to the equilibrium point under the load variations and parametric uncertainties.In addition,the influence of the twisting algorithm on the performance of closed-loop system is investigated and compared with other algorithms of first order sliding mode control such as adaptive sliding mode control(ASMC),nonsingular terminal sliding mode control(NTSMC).In comparative evaluation,the transient response of the output voltage with the step change in the load and the start-up response of the output voltage with the step change in the input voltage of buck converter were compared.Experimental results were obtained from a hardware setup constructed in laboratory.Finally,for all of the surveyed control methods,the theoretical considerations,numerical simulations,and experimental measurements from a laboratory prototype are compared for different operating points.It is shown that the proposed twisting method presents an improvement in steady state error and settling time of output voltage during load changes.展开更多
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.展开更多
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.展开更多
This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The...This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The continuous formulation and its first derivatives were evaluated at some selected grid and off grid points to obtain our proposed method. The superiority of the method over the existing methods is established numerically.展开更多
文摘This paper presents a simple and systematic approach to design second order sliding mode controller for buck converters.The second order sliding mode control(SOSMC)based on twisting algorithm has been implemented to control buck switch mode converter.The idea behind this strategy is to suppress chattering and maintain robustness and finite time convergence properties of the output voltage error to the equilibrium point under the load variations and parametric uncertainties.In addition,the influence of the twisting algorithm on the performance of closed-loop system is investigated and compared with other algorithms of first order sliding mode control such as adaptive sliding mode control(ASMC),nonsingular terminal sliding mode control(NTSMC).In comparative evaluation,the transient response of the output voltage with the step change in the load and the start-up response of the output voltage with the step change in the input voltage of buck converter were compared.Experimental results were obtained from a hardware setup constructed in laboratory.Finally,for all of the surveyed control methods,the theoretical considerations,numerical simulations,and experimental measurements from a laboratory prototype are compared for different operating points.It is shown that the proposed twisting method presents an improvement in steady state error and settling time of output voltage during load changes.
基金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 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.
文摘This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The continuous formulation and its first derivatives were evaluated at some selected grid and off grid points to obtain our proposed method. The superiority of the method over the existing methods is established numerically.
