Convex Optimization (Non-linear) (Convex Optimization (Non-linear))

From Algorithm Wiki
Jump to navigation Jump to search


Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets.


$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

Convex Optimization (Non-linear) - Time.png