REFERENCES
- M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, John Wiley & Sons, New York, 2006.
- L.F.P. Etman, A.A. Groenwold, and J.E. Rooda, First-order sequential convex programming using approximate diagonal QP subproblems, Struct. Multidiscip. Optim. 45 (2012), pp. 479–488. doi: 10.1007/s00158-011-0739-3
- R. Fletcher, Numerical experiments with an exact L1 penalty function method, in Nonlinear Programming 4, O.L. Mangasarian, R.R. Meyer, and S.M. Robinson, eds., Academic Press, New York, 1981, pp. 99–129.
- R. Fletcher, Practical Methods of Optimization, John Wiley & Sons, Chichester, 1987.
- R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Math. Program. 91 (2002), pp. 141–159. doi: 10.1007/s101070100244
- P.E. Gill and D.P. Robinson, A primal–dual augmented Lagrangian, Comput. Optim. Appl. 51 (2012), pp. 1–25. doi: 10.1007/s10589-010-9339-1
- A.A. Groenwold and L.F.P. Etman, Sequential approximate optimization using dual subproblems based on incomplete series expansions, Struct. Multidiscip. Optim. 36 (2008), pp. 547–570. doi: 10.1007/s00158-007-0197-0
- A.A. Groenwold and L.F.P. Etman, On the conditional acceptance of iterates in SAO algorithms based on convex separable approximations, Struct. Multidiscip. Optim. 42 (2010), pp. 165–178. doi: 10.1007/s00158-010-0498-6
- A.A. Groenwold, L.F.P. Etman, and D.W. Wood, Approximated approximations for SAO, Struct. Multidiscip. Optim. 41 (2010), pp. 39–56. doi: 10.1007/s00158-009-0406-0
- L.S. Lasdon, Duality and decomposition in mathematical programming, IEEE Trans. Syst. Sci. Cyb. ssc-4 (1968), pp. 86–100. doi: 10.1109/TSSC.1968.300135
- J. Nocedal and S.J. Wright, Numerical Optimization, Springer, New York, 1999.
- D.W. Wood, A.A. Groenwold, and L.F.P. Etman, Bounding the dual of Falk to circumvent the requirement of relaxation in globally convergent SAO algorithms, Draft Technical Computing Report, Department of Mechanical Engineering, University of Stellenbosch, Stellenbosch, 2011.