Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"annular constraint"”.

  1. Exact and Approximate Relaxation Techniques for Computational Guidance

    … problems. Relaxations transform a non-convex constraint into a convex constraint and provides proof that the optimal solutions to the relaxed problem are optimal for the original problem. Unique contributions of this work include: 1) a relaxation technique for solving fixed final time problems …

    utahstate Repository record for Exact and Approximate Relaxation Techniques for Computational Guidance (opens in a new tab)