Yet another Convex Optimization for GSL Code
Status: Beta
Brought to you by:
abheeksaha
| File | Date | Author | Commit |
|---|---|---|---|
| examples | 2011-09-30 | abheeksaha | [r50] Continuing bug fixes and changes, primal feasib... |
| inc | 2011-09-30 | abheeksaha | [r50] Continuing bug fixes and changes, primal feasib... |
| lib | 2011-08-26 | abheeksaha | [r48] Whole lot of changes. Fixed the infeasible star... |
| src | 2011-09-30 | abheeksaha | [r50] Continuing bug fixes and changes, primal feasib... |
| Makefile | 2011-08-26 | abheeksaha | [r48] Whole lot of changes. Fixed the infeasible star... |
| README | 2010-09-29 | abheeksaha | [r36] Added readme |
| inc.mk | 2011-08-26 | abheeksaha | [r48] Whole lot of changes. Fixed the infeasible star... |
The coptgsl code is intended as an extension to the gnu scientific library to solve standard convex optimization problems. As of now, we have routines for linear programming, Rosen's Gradient Programming, Second Order cone programming and two varieties of Semi-Definite Programming. The library makes extensive use of the GNU scientific library, specifically for linear algebra and matrix/vector manipulation. The library has been currently tested on a Linux installation. To build the library do cd lib ; make ; A set of example files are provided, demonstrating the use of the library. To build this code, do cd example ; make ; Comments, suggestions to abheek.saha@gmail.com