Prefer a chat interface with context about you and your work?
Decomposition in Conic Optimization with Partially Separable Structure
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general nonpolyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables. However in many applications the convex cones have a partially separable structure that allows them to be characterized in terms …