https://github.com/lihangliu/cs395t-numerical-optimization

Course projects of CS395T Numerical Optimization, UT Austin
https://github.com/lihangliu/cs395t-numerical-optimization

optimization proximal-policy-optimization trust-region-policy-optimization

Last synced: 3 months ago
JSON representation

Course projects of CS395T Numerical Optimization, UT Austin

• Host: GitHub
• URL: https://github.com/lihangliu/cs395t-numerical-optimization
• Owner: LihangLiu
• Created: 2017-11-29T20:01:38.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-12-06T03:36:15.000Z (over 7 years ago)
• Last Synced: 2025-01-13T06:27:25.755Z (4 months ago)
• Topics: optimization, proximal-policy-optimization, trust-region-policy-optimization
• Language: Python
• Homepage: http://www.cs.utexas.edu/~huangqx/CS395T_Numerical_Optimization.html
• Size: 21.8 MB
• Stars: 2
• Watchers: 2
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        

# Course projects of CS395T Numerical Optimization, UT Austin

  Go to each folder for problem descriptions and solvers.

  - [Shape deformation](https://github.com/LihangLiu/Numerical-Optimization/tree/master/shape-deformation)

   solved by Gradient Descent and Alternating Minimization

  - [Low rank matrix recovery](https://github.com/LihangLiu/Numerical-Optimization/tree/master/low-rank-matrix)

   solved by Gradient Descent, Alternating Minimization and Trust Region

  - [L1 penalty loss](https://github.com/LihangLiu/Numerical-Optimization/tree/master/proximal-gradient-descent)

   solved by Proximal Gradient Descent

   - [Linear programming](https://github.com/LihangLiu/Numerical-Optimization/tree/master/linear-programming)

   solved by Simplex method and Interior point method.