BlockIP implements a specialized primal-dual long-step path-following interior point algorithm for large scale linear, separable convex quadratic, or separable convex nonlinear problems with primal block angular structure.
BlockIPPlatform runs on top of BlockIP. It allows the formulation of convex separable block-angular structured problems through SML and AMPL , and its solution with BlockIP.BlockIP and BlockIPPlatform have been developed in the Group of Numerical Optimization and Modelling (Dept. of Statistics and Operations Research, Universitat Politècnica de Catalunya, Barcelona, Catalonia) by, respectively, Jordi Castro and Xavi Jiménez.
An online reference manual for BlockIP, generated with doxygen, is available:
An online reference manual for BlockIPPlatform, generated with doxygen, is available:
The distribution includes some examples of usage of the software. See the references for a description of the algorithms.
BlockIP and BlockIPPlatform are distributed without any warranty, including but not limited to the warranties of merchantability or fitness for a particular purpose.
BlockIP is NOT FREE. It can ONLY BE USED FOR RESEARCH PURPOSES. For other purposes (e.g. commercial, or any kind of development in funded R+D projects, in particular European Union funded projects), please contact the author (jordi.castroupc.edu).
BlockIPPlatform (only the model generation, excluding the BlockIP solver, ) is FREE. It requires AMPL (which is a commercial product) and SML (which was released under the LGPLv3 license).