Table 2

The three optimisation problems and selected algorithms are considered in this work. The objective function ξ is either the objective ξ(h)=ψ(h) or the natural logarithm of the objective ξ(h)=lnψ(h).

# Label Optimisation problem Selected algorithm
1 CG Unconstrained: Conjugate Gradient (CG) [44]
minhξ(h||h||2;x)

2 SLSQP Constrained - Variant 1: Sequential Least Squares Programming (SLSQP) [44]
minhξ(h;x), s.t. hTh=1

3 IED Constrained - Variant 2:
maxhhTA(h)h, s.t. hTB(h)h=1
Iterative Eigenvalue Decomposition (IED). Refer to the discussion in Appendix C.
where
ψ(h;x)=hTA(h)hhTB(h)h

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.