Publication | Closed Access

Is the classic convex decomposition optimal for bound-preserving schemes in multiple dimensions?

Mathematical ProgrammingNumerical AnalysisConic OptimizationEngineeringConvex OptimizationSemi-definite OptimizationSemidefinite ProgrammingBound-preserving SchemesComputational GeometryApproximation TheoryMultiple DimensionsLow-rank Approximation