Interior-point methods constitute a robust class of algorithms for solving constrained optimisation problems by exploring the interior of the feasible region instead of traversing its boundary. These ...
This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results