A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming

Engineering

• Optimisation Problem 100%
• Optimal Power Flow 100%
• Eigenvalue 50%
• Nodes 50%
• Engineering 50%
• Closed Form Solution 50%
• State Estimation 50%
• Unit Commitment 50%
• Flow State 50%
• Submatrix 50%
• Alternating Direction Method of Multipliers 50%
• Flow Problem 50%

Keyphrases

• Polynomial Optimization 25%
• Hard Optimization Problems 25%
• Computation Amount 25%
• Real-world Benchmark 25%
• Convexification 25%
• Optimal Power Flow 25%
• Optimization Theory 25%

Computer Science

• Tree Decomposition 20%
• Numerical Complexity 20%
• Unit Commitment 20%
• Optimization Theory 20%