A Java expression evaluator for nonlinear programming

Finding the optimal value for a problem is usual in many areas of knowledge where in many cases it is needed to solve Nonlinear Optimization Problems. For some of those problems it is not possible to determine the expression for its objective function and/or its constraints, they are the result of experimental procedures, might be non-smooth, among other reasons. To solve such problems it was implemented an API contained methods to solve both constrained and unconstrained problems. This API was developed to be used either locally on the computer where the application is being executed or remotely on a server. To obtain the maximum flexibility both from the programmers’ and users’ points of view, problems can be defined as a Java class (because this API was developed in Java) or as a simple text input that is sent to the API. For this last one to be possible it was also implemented on the API an expression evaluator. One of the drawbacks of this expression evaluator is that it is slower than the Java native code. In this paper it is presented a solution that combines both options: the problem can be expressed at run-time as a string of chars that are converted to Java code, compiled and loaded dynamically. To wide the target audience of the API, this new expression evaluator is also compatible with the AMPL format.

[1]  V. Torczon,et al.  Direct search methods: then and now , 2000 .

[2]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[3]  Charles Audet,et al.  Mesh Adaptive Direct Search Algorithms for Constrained Optimization , 2006, SIAM J. Optim..

[4]  Jeffrey C. Lagarias,et al.  Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions , 1998, SIAM J. Optim..

[5]  Roger Fletcher,et al.  On the global convergence of an SLP–filter algorithm that takes EQP steps , 2003, Math. Program..

[6]  Derong Liu,et al.  Advances in Computational Intelligence: Theory And Applications (Series in Intelligent Control and Intelligent Automation) , 2006 .

[7]  Nicholas I. M. Gould,et al.  An Interior-Point l 1 -Penalty Method for Nonlinear Optimization , 2010 .

[8]  Daniel J. Woods,et al.  Optimization on Microcomputers: The Nelder-Mead Simplex Algorithm , 1985 .

[9]  João Matias,et al.  Web-based application programming interface to solve nonlinear optimization problems , 2010, WCE 2010.

[10]  Jorge Nocedal,et al.  Steering exact penalty methods for nonlinear programming , 2008, Optim. Methods Softw..

[11]  João Matias,et al.  A web-based tool to evaluate the iterative processes of direct search methods , 2011, WCE 2011.

[12]  João Matias,et al.  Indoor Location Using Fingerprinting and Fuzzy Logic , 2011, Eurofuse.

[13]  João Matias,et al.  Direct-Search Penalty/Barrier Methods , 2010, WCE 2010.

[14]  Paul Tseng,et al.  Fortified-Descent Simplicial Search Method: A General Approach , 1999, SIAM J. Optim..

[15]  Katya Scheinberg,et al.  Introduction to derivative-free optimization , 2010, Math. Comput..

[16]  Charles Audet,et al.  A Pattern Search Filter Method for Nonlinear Programming without Derivatives , 2001, SIAM J. Optim..

[17]  Tamara G. Kolda,et al.  Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods , 2003, SIAM Rev..

[18]  Matjaz B. Juric,et al.  Comparison of performance of Web services, WS-Security, RMI, and RMI-SSL , 2006, J. Syst. Softw..

[19]  Carl Tim Kelley,et al.  Iterative methods for optimization , 1999, Frontiers in applied mathematics.

[20]  João Matias,et al.  Direct Search Optimization Application Programming Interface with Remote Access , 2010 .

[21]  T. Pietrzykowski.  An Exact Potential Method for Constrained Maxima , 1969 .

[22]  João Matias,et al.  RSS and LEA adaptation for indoor location using fingerprinting , 2012, WCE 2012.

[23]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[24]  Russell C. Eberhart,et al.  Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization , 2002 .

[25]  Tetsuyuki Takahama,et al.  Constrained Optimization by the epsilon Constrained Hybrid Algorithm of Particle Swarm Optimization and Genetic Algorithm , 2005, Australian Conference on Artificial Intelligence.