# Category:Convex optimization

Computing portal |

Here is a list of articles in the Convex optimization category of the Computing portal that unifies foundations of mathematics and computations using computers.

Convex optimization is included in the JEL classification codes as JEL: C62 |

Wikimedia Commons has media related to .Convex optimization |

## Pages in category "Convex optimization"

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

- Convex optimization
*(computing)*

### *

- Convexity in economics
*(computing)*

### B

- Barrier function
*(computing)* - Biconvex optimization
*(computing)* - Bregman method
*(computing)*

### C

- Conic optimization
*(computing)*

### D

- Danskin's theorem
*(computing)* - Duality (optimization)
*(computing)* - Duality gap
*(computing)*

### E

- Ellipsoid method
*(computing)* - Entropy maximization
*(computing)*

### F

- Fenchel's duality theorem
*(computing)*

### G

- Geodesic convexity
*(computing)* - Geometric programming
*(computing)*

### L

- Lagrangian relaxation
*(computing)* - Linear matrix inequality
*(computing)* - Linear programming
*(computing)*

### N

- Non-convexity (economics)
*(computing)*

### P

- Perturbation function
*(computing)* - Proximal gradient methods for learning
*(computing)* - Pseudoconvex function
*(computing)*

### Q

- Quasiconvex function
*(computing)*

### S

- Second-order cone programming
*(computing)* - Semidefinite programming
*(computing)* - Shapley–Folkman lemma
*(computing)* - Slater's condition
*(computing)* - Stochastic gradient descent
*(computing)* - Strong duality
*(computing)* - Structured sparsity regularization
*(computing)* - Subderivative
*(computing)* - Subgradient method
*(computing)*

### T

- Test functions for optimization
*(computing)* - Tracking error
*(computing)*

### W

- Weak duality
*(computing)* - Wolfe duality
*(computing)*