2. D. Lee, and M. Wiswall, “A Parallel Implementation of the Simplex Function Minimization Routine”, Comput. Econ., vol. 30, pp. 171–187, 2007.

3. M.J.D. Powell: The BOBYQA algorithm for bound constraint optimization without derivatives, Report DAMTP 2009/NA06, University of Cambridge, UK, 2009.

4. M.J.D. Powell: “A direct search optimization method that models the objective and constraint functions by linear interpolation,” Proc. Sixth Workshop on Optimization and Numerical Analysis, vol. 275, pp. 51–67, Kluwer Academic Publishers, Dordrecht, NL, 1994.

5. D.R. Jones, M. Schonlau, and W.J. Welch, “Efficient global optimization of expensive black-box functions,” J.Glob. Optim., vol. 13, pp. 455-492, 1998.

6. P.E. Gill, W. Murray, and M.A. Saunders, User’s Guide for SNOPT Version 7: Software for Large-Scale Nonlinear Programming, Systems Optimization Laboratory (SOL), Stanford University, 2006.

7. P.E. Gill, W. Murray, and M.A. Saunders, “SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization”, SIAM Review, vol. 47, no. 1, pp. 99–131, 2005.

8. A. Wächter and T.B. Lorenz, “On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,” Math. Program., vol. 106, no. 1, pp. 25–57, 2006.

9. K. Svanberg, MMA and GCMMA – Fortran versions March 2013, KTH, Royal Institute of Technology, Stockholm, 2013.

10. K.Svanberg, “The Method of Moving Asymptotes – a new Method for Structural Optimization”, Int. J. Numer. Methods Eng., vol. 24, no. 2, pp. 369–373, 1987.

11. K. Madsen, H.B. Nielsen, and O. Tingleff, Methods for Non-Linear Least Squares Problems, 2nd ed., 2004.

12. R. Andreani, E.G. Birgin, J.M. Martinez, and M.L. Schuverdt, “On Augmented Lagrangian Methods with general lower-level constraints.”, SIAM J. Optim., vol. 18, pp. 1286–1309, 2007.