SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs). Please send a message to kojima-spop@is.titech.ac.jp if you have any question and/or request.
We also release SparsePOPC++ and SparsePOPC++-windows. Both implementations are SparsePOP which does not use MATLAB, but only C++. In particular, SparsePOPC++-windows contains a binary file which works on Windows, and does not require to compile.
Features
- A MATLAB implementation of sparse semidefinite programming (SDP) relaxation
- Effective for a polynomial optimization problem with sparse structure
- Use SeDuMi, SDPA, SDPT3, CSDP and SDPNAL as SDP solvers
- Incorporate local solvers in Optimization Toolbox with SparsePOP to refine the solution and value obtained by SparsePOP
- A C++ implementation of SparsePOP is released (SDPA is necessary)
Categories
MathematicsLicense
GNU General Public License version 2.0 (GPLv2)Follow SparsePOP
Other Useful Business Software
Crowdtesting That Delivers | Testeum
Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of SparsePOP!