WORHP

WORHP

Developer(s)	Christof Büskens, Matthias Gerdts et al.
Initial release	March 2010 (2010-03)

Stable release	1.8-938b332 / 27 July 2015 (2015-07-27)
Written in	ANSI C, FORTRAN 77, Fortran 95 and Fortran 2003
Operating system	Unix-like, Windows XP and later
Available in	English
Type	Numerical software
License	Proprietary, Free of charge for academic users.
Website	worhp.de

WORHP, pronounced like the English word "warp", also referred to as eNLP (European NLP solver) by ESA, is a mathematical software library for solving continuous large scale nonlinear optimization problems numerically. The acronym WORHP is sometimes spelled out as "We Optimize Really Huge Problems", its primary intended application. WORHP is a hybrid Fortran and C implementation and can be used from C/C++ and Fortran programs using different interfaces of varying complexity and flexibility. In addition interfaces for the modelling environments MATLAB, CasADi and AMPL exist.^[1]

Problem formulation

WORHP is designed to solve problems of the form

\min _{x\in \mathbb {R} ^{n}}f(x)

subject to

L\leq {\begin{pmatrix}x\\g(x)\end{pmatrix}}\leq U

with sufficiently smooth functions $f:\mathbb {R} ^{n}\to \mathbb {R}$ (objective) and $g:\mathbb {R} ^{n}\to \mathbb {R} ^{m}$ (constraints) that may be nonlinear, and need not necessarily be convex. Even problems with large dimensions $n$ and $m$ can be solved efficiently, if the problem is sufficiently sparse. Cases where objective and constraints cannot be evaluated separately, or where constraints can be evaluated element-wise can be exploited by WORHP to increase the computational efficiency.

Derivatives

WORHP requires the first derivative (Gradient) of $f$ and of $g$ (Jacobian) and second derivatives (Hessian matrix) of the Lagrange function; in a modelling environment like AMPL, these are provided by automatic differentiation methods, but need to be provided by the caller in other environments. First and second derivatives can be approximated by WORHP using finite differences. To reduce the otherwise prohibitively high number of necessary function evaluations in large scale sparse problems, graph colouring theory is used to group first and second partial derivatives. Second derivatives may also be approximated using variations of the classic BFGS method, including block-diagonal or sparse BFGS matrices.

Structure

The NLP level of WORHP is based on SQP, while the quadratic subproblems are solved using an interior point method. This approach was chosen to benefit from the robustness of SQP methods and the reliable runtime complexity of IP methods, since traditional active set methods may be unsuitable for large-scale problems.

Development

Development of WORHP started in 2006 with funding from DLR and was continued under the eNLP label after 2008 with support by ESA / ESTEC together with the Interior-Point solver ipfilter^[2] (whose inclusion in eNLP was discontinued after 2010) to develop a European NLP solver for use in trajectory optimisation, mission analysis and aerospace applications in general.^[3]

The development of WORHP is led by the Steinbeis-Forschungszentrum Optimierung, Steuerung und Regelung and scientists of the Optimization and Optimal Control Group at the University of Bremen, and at the Bundeswehr University of Munich.^[4] The developers stress that WORHP, despite its academic roots, is intended as industrial-grade tool rather than an academic research platform.^[5]

Applications

WORHP has been integrated into trajectory analysis tools such as LOTNAV^[6] and ASTOS, and is being used at ESOC and ESTEC. It can be used as optimiser in CasADi (since version 1.5.0beta)^[7] and as local optimiser in SVAGO MDO^[8] tool developed at University of Bremen and Politecnico di Milano on Multidisciplinary design optimization through the ESA PRESTIGE program.^[9]

References

↑ "WORHP interfaces".
↑ Luis Vicente; Renata Silva; Michael Ulbrich; Stefan Ulbrich. "ipfilter — An NLP Solver based on a primal-dual interior-point filter algorithm".
↑ Sven Erb (2011-03-02). "eNLP: application-centric NLP-based optimization in the aerospace market". ITN Sadco First Industrial Workshop.
↑ "Development Team". Retrieved 2013-05-27.
↑ Christof Büskens; Dennis Wassel. "The ESA NLP Solver WORHP". Retrieved 2013-05-27.
↑ J. L. Cano; M. Bello; J. Rodriguez-Canabal (2004). "Navigation and Guidance for Low-Thrust Trajectories, LOTNAV".
↑ "CasADi wiki". Retrieved 2013-05-27.
↑ Francesco Castellini (2009). "PRESTIGE MDO research, Research Achievements". Retrieved 2011-03-23.
↑ ESA education (2009). "Universities selected for PRESTIGE programme". Retrieved 2011-03-23.

External links

Mathematical optimization software

Data formats	LP MPS nl OptML OSiL sol xMPS

Modeling tools	AIMMS AMPL APMonitor CMPL CVX CVXOPT CVXPY ECLiPSe-CLP GAMS GNU MathProg JuMP LINDO OPL MPL OptimJ PICOS PuLP Pyomo ROML TOMLAB Xpress-Mosel YALMIP ZIMPL

LP, MILP^∗ solvers	ABACUS^∗ APOPT^∗ Artelys Knitro^∗ BCP^∗ BDMLP BPMPD BPOPT CLP CBC^∗ CPLEX^∗ CSDP DSDP FortMP^∗ GCG^∗ GIPALS32 GLPK/GLPSOL^∗ Gurobi^∗ HOPDM LINDO^∗ lp_solve^∗ LOQO MINOS MINTO^∗ MOSEK^∗ OOPS OOQP PCx QSopt SAS/OR^∗ SCIP^∗ SoPlex SOPT-IP^∗ Sulum Optimization Tools^∗ SYMPHONY^∗ XA^∗ Xpress-Optimizer^∗

QP, MIQP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT BQPD CBC^∗ CLP CPLEX^∗ FortMP^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LSSOL LOQO MINOS MOSEK^∗ OOPS OOQP QPOPT QPSOL SCIP^∗ XA Quadratic Solver Xpress-Optimizer^∗

QCP, MIQCP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT CPLEX^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LOQO MINOS MOSEK^∗ SCIP^∗ Xpress-Optimizer^∗ Xpress-SLP^∗

SOCP, MISOCP^∗ solvers	CPLEX^∗ DSDP Gurobi^∗ LINDO^∗ LOQO MOSEK^∗ SCIP^∗ SDPT3 SeDuMi Xpress-Optimizer^∗

SDP, MISDP^∗ solvers	CSDP DSDP MOSEK PENBMI PENSDP SCIP-SDP^∗ SDPA SDPT3 SeDuMi

NLP, MINLP^∗ solvers	ALGENCAN AlphaECP^∗ ANTIGONE^∗ AOA^∗ APOPT^∗ Artelys Knitro^∗ BARON^∗ Bonmin^∗ BPOPT CONOPT Couenne^∗ DICOPT^∗ FilMINT^∗ FilterSQP Galahad library ipfilter IPOPT LANCELOT LINDO^∗ LOQO LRAMBO MIDACO^∗ MILANO^∗ MINLP BB^∗ MINOS Minotaur^∗ MISQP^∗ NLPQLP NPSOL OQNLP^∗ PATHNLP PENNON SBB^∗ SCIP^∗ SNOPT^∗ SQPlab WORHP Xpress-SLP^∗

GO solvers	BARON Couenne^∗ LINDO SCIP

CP solvers	Artelys Kalis Choco Comet CPLEX CP Optimizer Gecode Google CP Solver JaCoP OscaR

Metaheuristic solvers	OptaPlanner LocalSolver

List of optimization software Comparison of optimization software

This article is issued from Wikipedia - version of the 6/6/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.