Convex Optimization (Non-linear): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| 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 == | ||
Revision as of 07:52, 10 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)
Space Complexity Graph
_-_Space.png)
Time-Space Tradeoff
_-_Pareto_Frontier.png)