Jump to content

Category:Convex optimization

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Fayenatic london (talk | contribs) at 13:03, 23 June 2017 (merge, with changes, from Category:Convexity in economics). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

Shortcut
- {{MSC}}

This category corresponds roughly to MSC 90C25 Convex programming; see 90C25 at MathSciNet and 90C25 at zbMATH.

Subcategories

This category has only the following subcategory.

L

Linear programming (1 C, 59 P)

Pages in category "Convex optimization"

The following 41 pages are in this category, out of 41 total. This list may not reflect recent changes.

*

Convexity in economics

A

Algorithmic problems on convex sets

B

C

D

E

Ellipsoid method

F

Fenchel's duality theorem

G

L

M

Maximum theorem

N

Non-convexity (economics)

P

Q

Quasiconvex function

S

T

W

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Convex_optimization&oldid=787104213"

Hidden category:

Categories which are included in the JEL classification codes