Web-based application programming interface to solve nonlinear optimization problems

Nonlinear Optimization Problems are usual in many engineering fields. Due to its characteristics the objective function of some problems might not be differentiable or its derivatives have complex expressions. There are even cases where an analytical expression of the objective function might not be possible to determine either due to its complexity or its cost (monetary, computational, time, ...). In these cases Nonlinear Optimization methods must be used. An API, including several methods and algorithms to solve constrained and unconstrained optimization problems was implemented. This API can be accessed not only as traditionally, by installing it on the developer and/or user computer, but it can also be accessed remotely using Web Services. As long as there is a network connection to the server where the API is installed, applications always access to the latest API version. Also an Web-based application, using the proposed API, was developed. This application is to be used by users that do not want to integrate methods in applications, and simply want to have a tool to solve Nonlinear Optimization Problems.

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

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

[3]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[4]  Charles Audet,et al.  Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search , 2006, J. Glob. Optim..

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

[6]  J. Mark Bull,et al.  Benchmarking Java against C and Fortran for scientific applications , 2001, JGI '01.

[7]  Charles Audet,et al.  Analysis of Generalized Pattern Searches , 2000, SIAM J. Optim..

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

[9]  Charles Audet,et al.  Convergence Results for Pattern Search Algorithms are Tight , 2002 .

[10]  John L. Nazareth,et al.  Introduction to derivative-free optimization , 2010, Math. Comput..

[11]  Anju Vyas.  Print , 2003 .

[12]  G. P. Nikishkov,et al.  Comparison of C and Java performance in finite element computations , 2003 .

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

[14]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

[16]  Robert A. van Engelen,et al.  Pushing the SOAP Envelope with Web Services for Scientific Computing , 2003, ICWS.

[17]  Charles Audet,et al.  Globalization strategies for Mesh Adaptive Direct Search , 2008, Comput. Optim. Appl..

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

[19]  Claudia A. Sagastizábal,et al.  A bundle-filter method for nonsmooth convex constrained optimization , 2008, Math. Program..