A bounding method for convex semi-infinite programming
A method for solving a class of convex semi-infinite programming (SIP) problems
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
The solver adresses a class of convex semi-infinite programming (SIP) problems. The algorithm implements an exchange type method for SIP where the lower bound problem is addressed by a branch and bound method.
The code is written in MATLAB. It provides an interface with AMPL. See the solver webpage at http://www.norg.uminho.pt/aivaz/csip.html.
CSIP is freely available for educational, research, and commercial use, but we expect that all publications describing work using this software quote the reference given below.
Le Thi Hoai An, Mohand Ouanes, and A.I.F. Vaz, A branch and bound approach for convex semi-infinite programming, submitted.
Cite As
Ismael Vaz (2026). A bounding method for convex semi-infinite programming (https://www.mathworks.com/matlabcentral/fileexchange/63846-a-bounding-method-for-convex-semi-infinite-programming), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0 (13.6 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0 |
|
