- Source: WORHP
WORHP ( "warp", an acronym for "We Optimize Really Huge Problems"), also referred to as eNLP (European NLP solver) by ESA, is a mathematical software library for numerically solving large scale continuous nonlinear optimization problems.
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. There are also interfaces for the MATLAB, CasADi and AMPL modelling environments.
Problem formulation
WORHP is designed to solve problems of the form
min
x
∈
R
n
f
(
x
)
{\displaystyle \min _{x\in \mathbb {R} ^{n}}f(x)}
subject to
L
≤
(
x
g
(
x
)
)
≤
U
{\displaystyle L\leq {\begin{pmatrix}x\\g(x)\end{pmatrix}}\leq U}
with sufficiently smooth functions
f
:
R
n
→
R
{\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} }
(objective) and
g
:
R
n
→
R
m
{\displaystyle 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
{\displaystyle n}
and
m
{\displaystyle 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
{\displaystyle f}
and of
g
{\displaystyle 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
(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.
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.
The developers stress that WORHP, despite its academic roots, is intended as industrial-grade tool rather than an academic research platform.
Applications
WORHP has been integrated into trajectory analysis tools such as LOTNAV
and ASTOS, and is being used at ESOC and ESTEC. It can be used as optimiser in CasADi (since version 1.5.0beta)
and as local optimiser in SVAGO MDO tool developed at University of Bremen and Politecnico di Milano on Multidisciplinary design optimization through the ESA PRESTIGE program.
See also
Sequential quadratic programming
Penalty-interior-point algorithm
References
External links
WORHP home page
WORHP overview chapter
