Article
Full entry |
PDF
(1.0 MB)
Feedback
PDF
(1.0 MB)
Feedback
References:
[1] R. M. Chamberlain M. J. D. Powell C. Lemarechal, H. C. Pedersen: The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Programming Study 16 (1982), 1 - 17. MR 0650626
[2] R. Fletcher: The calculation of feasible points for linearly constrained optimisation problems. A.E.R.E. Harwell Report No. R-6354 (1970).
[3] R. Fletcher: Second order corrections for non-differentiable optimization. In: Numerical Analysis, Dundee 1981 (G. A. Watson ed.), Lecture Notes in Mathematics 912, Springer-Verlag, Berlin 1982. MR 0654345
[4] P. E. Gill, W. Murray: Safeguarded steplength algorithms for optimization using descent methods. National Physical Lab. Report No. NAC-37 (1974).
[5] S. P. Han: Variable metric methods for minimizing a class of nondifferentiable functions. Math. Programming 20 (1981), 1, 1-13. MR 0594019 | Zbl 0441.90095
[6] L. Lukšan: Software package for optimization and nonlinear approximation. In: Proc. of the 2nd IFAC/IFIP Symposium on Software for Computer Control, Prague 1979.
[7] L. Lukšan: Dual method for solving a special problem of quadratic programming as a sub-problem at linearly constrained nonlinear minimax approximation. Kybernetika 20 (1984), 6, 445-457. MR 0777979
[8] L. Lukšan: A compact variable metric algorithm for linearly constrained nonlinear minimax approximation. Kybernetika 21 (1985), to appear. MR 0831100
[9] M. J. D. Powell: A fast algorithm for nonlinearly constrained optimization calculations. In: Numerical Analysis, Dundee 1977 (G. A. Watson ed.), Lecture Notes in Mathematics 630, Springer-Verlag, Berlin 1978. MR 0483447
Search
Partner of
