# Category:First order methods

Here is a list of articles in the category **First order methods** of the Computing portal that unifies foundations of mathematics and computations using computers. In numerical analysis, methods that have at most linear local error are called **first order methods.** They are frequently based on finite differences, a local linear approximation.

## Subcategories

This category has the following 2 subcategories, out of 2 total.

## Pages in category "First order methods"

The following 8 pages are in this category, out of 8 total.

### E

- Euler method
*(computing)*

### F

- Proximal gradient methods for learning
*(computing)* - Structured sparsity regularization
*(computing)* - Frank–Wolfe algorithm
*(computing)*

### G

- Gradient descent
*(computing)* - Gradient method
*(computing)*

### L

- Linear approximation
*(computing)*

### S

- Schild's ladder
*(computing)*