Abstract
EMP is an interactive software system that supports the numerical solution of various mathematical programming problems, e.g. of nonlinear programming, data fitting, min-max programming, multicriteria optimization, non-smooth optimization, quadratic programming, or linear programming, subject to linear or nonlinear constraints. Nonlinear problem functions must be defined by sequences of FORTRAN statements assigning a numerical value to a user-provided name. The system writes complete FORTRAN source programs, which are linked and executed automatically. For each nonlinear programming model, program generators for several mathematical algorithms are available. The selection of a suitable code is supported by EMP heuristically depending on the requirements of the user. The system is capable to learn, i.e. to improve its own knowledge on the success of the algorithms, and to perform a rule-based error analysis in case of nonsuccessful termination. The paper describes the heuristic, knowledge-based options of the user interface.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brown K.M., Dennis J.E. (1972): Derivative free analogous of the Levenberg-Marquardt and Gauss-Newton algorithms for nonlinear least squares approximations Numerische Mathematik, Vol.18, 289–297
Dennis Jr. D.M., Gay D.M., Welsch R.E. (1981a): An adaptive nonlinear least-squares algorithm ACM Transactions on Mathematical Software, Vol.7, 348–368
Dennis Jr. D.M., Gay D.M., Welsch R.E. (1981b): Algorithm 573. NL2SOL — An adaptive nonlinear least-squares algorithm ACM Transactions on Mathematical Software, Vol.7, 369–383
Fletcher R. (1972): Fortran subroutines for minimization by quasi-Newton methods Report R7125, AERE, Harwell, England
Gill P.E., Murray W. (1978): Algorithms for the solution of the non-linear least-squares problem CIAM Journal on Numerical Analysis, Vol.15, 977–992
Gill P.E., Murray W., Saunders M.A., Wright M.H. (1983a): User's guide for SOL/NPSOL: a FORTRAN package for nonlinear programming Report SOL 83-12, Department of Operations Research, Stanford University, Stanford, USA
Gill P.E., Murray W., Saunders M.A., Wright M.A. (1983b): User's guide for SOL/QPSOL: A FORTRAN package for quadratic programming Report SOL SOL 83-7, Dept. of Operations Research, Stanford University, USA
Goldfarb D., Idnani A. (1983): A numerically stable dual method for solving strictly convex quadratic programs Mathematical Programming, Vol.27, 1–33
Griewank A. (1989): On automatic differentiation in: Mathematical Programming: Recent Developments and Applications, ed. M. Iri, K. Tanabe, Kluwer Academic Publishers, Boston
Lemarechal C., Strodiot J.-J., Bihain A. (1981): On a bundle algorithm for nonsmooth optimization in: Mangasarian, Meyer, Robinson eds.: Nonlinear Programming, Academic Press
Liepelt M., Schittkowski K. (1990): PCOMP: A FORTRAN code for automatic differentiation Report, Mathematisches Institut, Universitt Bayreuth, D-8580 Bayreuth
Lindström P. (1983): Algorithms for nonlinear least squares particularly problems with constraints Report UMINF-106.83, Institute of Information Processing, University of Umea, Sweden
Powell M.J.D. (1983): On the quadratic programming algorithm of Goldfarb and Idnani Report DAMTP 1983/Na 19, University of Cambridge, Great Britain
Schittkowski K. (1985): Solving constrained nonlinear least squares problems by a general purpose SQP-method in: Trends in Mathematical Optimization, K.-H. Hoffmann, J.-B. Hiriart-Urruty, C. Lemarechal, J. Zowe eds., International Series of Numerical Mathematics, Vol.84, Birkhäuser
Schittkowski K. (1985/86): NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems Annals of Operations Research, Vol. 5, 485–500
Schittkowski K. (1986a): ELL: A FORTRAN implementation of an ellipsoid algorithm for nonlinear programming: User's guide Report, Mathematisches Institut, Universität Bayreuth, FRG D-8580 Bayreuth
Schittkowski K. (1986b): MCO: A FORTRAN implementation of an interactive multicriteria optimization method, user's guide Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1986c): DFNLP: A FORTRAN implementation of an SQP-algorithm for constrained nonlinear data fitting and min-max problems, user's guide Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1986d): DFELL: A FORTRAN implementation of an ellipsoid algorithm for nonlinear data fitting, user's guide Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1986e): QL: A FORTRAN implementation of a dual algorithm for quadratic programming, user's guide Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1986f): LP: A FORTRAN implementation of the simplex algorithm for linear programming, user's guide Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1987): Die Systementwicklungssprache SUSY Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth F.R.
Schittkowski K. (1990a): Heuristic reasoning in mathematical programming DFG-SP ‘Anwendungsbezogene Optimierung und Steuerung', Report. No.209, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1990b): Solving nonlinear programming problems with very many constraints Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1990c): NLPQLA: A nonlinear programming code with symbolic function input and automatic differentiation, user's guide Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schittkowski K. (1990d): DFNLPA: A nonlinear least squares code with symbolic function input and automatic differentiation, user's guide Report, Mathematisches Institut, Universität Bayreuth, D-8580 Bayreuth
Schramm H. (1989): Eine Kombination von Bundle-und Trust-Region-Verfahren zur Lösung nichtdifferenzierbarer Optimierungsprobleme Dissertation, Mathematisches Institut, Universität Bayreuth
Shor N.Z. (1977): Cut-off method with space extension in convex programming Cybernetics, Vol.12, 94–96
Törn A., Zilinskas A. (1989): Global optimization Lecture Notes in Computer Science, Vol. 350, Springer
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 International Federation for Information Processing
About this paper
Cite this paper
Schittkowski, K. (1992). Heuristic reasoning with the interactive mathematical programming system emp. In: Beulens, A.J.M., Sebastian, HJ. (eds) Optimization-Based Computer-Aided Modelling and Design. Lecture Notes in Control and Information Sciences, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040147
Download citation
DOI: https://doi.org/10.1007/BFb0040147
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55135-5
Online ISBN: 978-3-540-46741-0
eBook Packages: Springer Book Archive