Convex Optimization (Non-linear): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
$n$: number of variables | |||
$m$: number of constraints | |||
$L$: length of input, in bits | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 15: | Line 19: | ||
[[File:Convex Optimization (Non-linear) - Time.png|1000px]] | [[File:Convex Optimization (Non-linear) - Time.png|1000px]] | ||
Latest revision as of 10:07, 28 April 2023
Description
Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets.
Parameters
$n$: number of variables
$m$: number of constraints
$L$: length of input, in bits
Table of Algorithms
Currently no algorithms in our database for the given problem.
Time Complexity Graph
_-_Time.png)