‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

We develop the dynamic programming approach for a family of infinite horizon boundary control problems with linear state equation and convex cost. We prove that the value function of the problem is the unique regular solution of the associated stationary Hamilton–Jacobi–Bellman equation and use this to prove existence and uniqueness of feedback controls. The idea of studying this kind of proble...

This paper studies the Discrete-Time Switched LQR problem over an infinite time horizon, subject to polyhedral constraints on state and control inputs. Specifically, we aim to find an infinite-horizon hybrid-control sequence, i.e., a sequence of continuous and discrete (switching) control inputs, that minimizes an infinite-horizon quadratic cost function, subject to polyhedral constraints on st...