Convex Optimization (Non-linear) (Convex Optimization (Non-linear))
Jump to navigation
Jump to search
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)