An Efficient Penalty Coefficient Iterative Algorithm for Power Control of Range Extender With Constraints

In order to deal with various constraints in power control of the range extender, quadratic function is used as the penalty function to construct optimal control problem. To ensure that the optimal solution can be found quickly, this paper proposes a new iterative algorithm for penalty coefficients. The algorithm establishes a state space equation related to the penalty coefficient, which takes the difference between the decision variable that violates the constraint condition and the boundary of the feasible region as the state quantity. By introducing the Gerschgorin Circle Theorem, the eigenvalues of the system matrix are restricted to be within the unit circle, which guarantees the convergence. On the basis of ensuring the convergence, the overall convergence rate of the algorithm is improved by minimizing the radius of the circle containing the eigenvalues. Compared with the existing iterative methods of penalty coefficients, the proposed algorithm has better convergence. The effectiveness and practicability of the proposed algorithm are evaluated through numerical simulations on Simulink.