Graph Coarsening Method for KKT Matrices Arising from Orthogonal Collocation Methods for Optimal Control Problems Conference Paper uri icon

abstract

  • 2015, American Institute of Aeronautics and Astronautics Inc. All Rights Reserved. State-defect constraint pairing graph coarsening method is described for large sparse Karush-Kuhn-Tucker (KKT) matrices that arise from the discretization of optimal control problems via an orthogonal collocation method. The method takes advantage of the known sparsity pattern of the KKT matrix. For any particular optimal control problem, the method pairs each component of the state with its corresponding defect constraint. Following that the method forces paired rows to be adjacent in the reordered KKT matrix. Aggregate results are presented using a wide variety of benchmark optimal control problems and show that the method reduces the number of delayed pivots and the number of floating point operations significantly.

name of conference

  • 56th AIAA/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference

published proceedings

  • 56th AIAA/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference

author list (cited authors)

  • Senses, B., Davis, T. A., & Rao, A. V.

citation count

  • 0

complete list of authors

  • Senses, Begum||Davis, Timothy A||Rao, Anil V

publication date

  • January 2015