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
Gen AI apps are built with MongoDB Atlas
MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of SparsePOP!