Many formulations of quadratic allocation problems, portfolio optimization problems, the maximum weight clique problem, among others, take the form as the well-known standard quadratic optimization problem, which consists ...

New equations involving the unknown final states and initial costates corresponding to families of LQR problems are found, and their solutions are computed and validated. Having the initial values of the costates, the ...

The Quadratic Assignment Problem (QAP) is a combinatorial optimization problem; it belongs to the class of NP-hard problems. This problem is applied in various fields such as hospital layout, scheduling parallel production ...

The DPG method with optimal test functions for solving linear quadratic optimal control problems with control constraints is studied. We prove existence of a unique optimal solution of the nonlinear discrete problem and ...

We propose a discrete approximation scheme to a class of Linear Quadratic Continuous Time Problems. It is shown, under positiveness of the matrix in the integral cost, that optimal solutions of the discrete problems provide ...

We propose a discrete approximation scheme to a class of Linear Quadratic Continuous Time Problems. It is shown, under positiveness of the matrix in the integral cost, that optimal solutions of the discrete problems provide ...

We propose a discrete approximation scheme to a class of Linear Quadratic Continuous Time Problems. It is shown, under positiveness of the matrix in the integral cost, that optimal solutions of the discrete problems provide ...

Smart grid schemes in which multiple network elements and participants are managed for the benefit of the distribution network (e.g., energy loss reduction, restoration, etc.) require sophisticated algorithms to control ...