Useful Links
Mathematics
Numerical Methods
1. Introduction to Numerical Methods
2. Foundational Concepts in Numerical Computation
3. Root Finding Methods
4. Linear Systems of Equations
5. Interpolation and Approximation
6. Curve Fitting and Least Squares
7. Numerical Differentiation
8. Numerical Integration
9. Ordinary Differential Equations
10. Partial Differential Equations
11. Optimization Methods
12. Eigenvalue Problems
Optimization Methods
Unconstrained Optimization
One-Dimensional Search
Golden Section Search
Fibonacci Search
Parabolic Interpolation
Newton's Method
Multidimensional Methods
Gradient Descent
Steepest Descent
Step Size Selection
Convergence Rate
Newton's Method
Hessian Matrix
Quadratic Convergence
Implementation Issues
Quasi-Newton Methods
BFGS Method
DFP Method
Secant Conditions
Conjugate Gradient
Fletcher-Reeves
Polak-Ribière
Linear Conjugacy
Line Search Methods
Exact Line Search
Inexact Line Search
Wolfe Conditions
Backtracking
Constrained Optimization
Linear Programming
Standard Form
Simplex Method
Basic Solutions
Pivot Operations
Optimality Conditions
Duality Theory
Nonlinear Constraints
Lagrange Multipliers
KKT Conditions
Penalty Methods
Barrier Methods
Sequential Quadratic Programming
Previous
10. Partial Differential Equations
Go to top
Next
12. Eigenvalue Problems