An efficient algorithm for solving linear equality-constrained LQR problems.
João Sousa PintoDominique OrbanPublished in: CoRR (2024)
Keyphrases
- convex quadratic programming
- constrained problems
- quadratic programming
- benchmark problems
- combinatorial optimization
- algebraic equations
- learning algorithm
- linear systems
- k means
- segmentation algorithm
- nonlinear optimization problems
- combinatorial optimisation
- optimization algorithm
- expectation maximization
- cost function
- optimal solution
- dynamic programming
- closed form
- evolutionary algorithm
- preprocessing
- objective function
- integer program
- neural network
- quadratic optimization problems
- similarity measure
- search algorithm for solving
- efficient algorithms for solving
- gradient projection
- computational complexity
- quadratic program
- linear complexity
- iterative algorithms
- worst case
- partial solutions
- lower bound
- convex hull
- detection algorithm
- np hard
- computationally efficient
- probabilistic model