Tag: Optimization

Optimization theory

Convex Problems

Convex Problems

Many problems in engineering analysis and design can be cast as convex optimization problems, often non-linear and non-differentiable. Specifically, Convex optimization problems can be solved by some modern methods such as subgradient projection and interior point methods or by some old methods such as cutting plane methods, ellipsoid methods, and subgradient methods.

error: Hey, drop me a line if you want some content!!