Award DE-FG02-04ER52655 Final Technical Report: Interior Point Algorithms for Optimization Problems
- Univ. of Maryland
Over the period of this award we developed an algorithmic framework for constraint reduction in linear programming (LP) and convex quadratic programming (QP), proved convergence of our algorithms, and applied them to a variety of applications, including entropy-based moment closure in gas dynamics.
- Research Organization:
- University of Maryland, College Park, MD
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- Contributing Organization:
- University of Maryland
- DOE Contract Number:
- FG02-04ER25655
- OSTI ID:
- 1126783
- Report Number(s):
- DOE-UMD-52655-1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sequential quadratic programming algorithms for optimization
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
A path-following interior-point algorithm for linear and quadratic problems
Technical Report
·
Tue Aug 01 00:00:00 EDT 1989
·
OSTI ID:1126783
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
Journal Article
·
Wed Jul 21 00:00:00 EDT 2021
· Mathematical Programming
·
OSTI ID:1126783
A path-following interior-point algorithm for linear and quadratic problems
Technical Report
·
Wed Dec 01 00:00:00 EST 1993
·
OSTI ID:1126783