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
You Might Also Like
MongoDB Atlas runs apps anywhere
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of SparsePOP!