Convex Optimization (Non-linear): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 20: | Line 20: | ||
[[File:Convex Optimization (Non-linear) - Space.png|1000px]] | [[File:Convex Optimization (Non-linear) - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:Convex Optimization (Non-linear) - Pareto Frontier.png|1000px]] | [[File:Convex Optimization (Non-linear) - Pareto Frontier.png|1000px]] | ||
Revision as of 14:36, 15 February 2023
Description
Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets.
Parameters
No parameters found.
Table of Algorithms
Currently no algorithms in our database for the given problem.
Time Complexity Graph
_-_Time.png)
Space Complexity Graph
_-_Space.png)
Space-Time Tradeoff Improvements
_-_Pareto_Frontier.png)