Category:Convex optimization

L

• Linear programming (1 C, 59 P)

• Convex optimization
• Separation oracle

*

• Convexity in economics

A

• Algorithmic problems on convex sets

B

• Barrier function
• Biconvex optimization
• Bregman method

C

• Center-of-gravity method
• Clarke generalized derivative
• Conic optimization

D

• Danskin's theorem
• Duality (optimization)
• Duality gap

E

• Ellipsoid method

F

• Fenchel's duality theorem

G

• Geodesic convexity
• Geometric programming

L

• Lagrangian relaxation
• Linear matrix inequality
• Linear programming

M

• Maximum theorem

N

• Non-convexity (economics)

P

• Perturbation function
• Power cone
• Proximal gradient methods for learning
• Pseudoconvex function

Q

• Quasiconvex function

S

• Second-order cone programming
• Semidefinite programming
• Shapley–Folkman lemma
• Slater's condition
• Stochastic gradient descent
• Stochastic variance reduction
• Strong duality
• Structured sparsity regularization
• Subderivative
• Subgradient method
• Support vector machine

T

• Test functions for optimization
• Tracking error

W

• Weak duality
• Wolfe duality