Non-convex Optimization via Convex Optimization Algorithms

Описание: Non-convex problems can sometimes be solved exactly (by recognizing hidden convexity, proving strong duality, or using bisection) or inexactly (relaxing, or via algorithms such as BCD, MM, SCA).