|
Java FTP Component
Java Secure FTP, FTP, SSL, SSH
Java SSH, Java Telnet
Java Server Faces, JSF, AJAX
Managed File Transfer, JSCAPE Secure FTP Server, Linux FTP Server, Solaris FTP Server
SSH .NET
FTP .NET, FTPS .NET
Java FTP
|
|
| Applications / WebCab Optimization (J2EE Edition) |
Refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have linear constraints. Specialized Linear programming algorithms based on the Simplex Algorithm and duality are included along with a framework for sensitivity analysis w.r.t. boundaries (duality, or direct approach), or object function coefficients.
Product Details
This suite includes the following features:
- Local unidimensional optimization - finds global minima / maxima for continuous functions in one dimension
- Fast `low level' algorithms - use these algorithms when your primary concern is the speed and
not the accuracy of the results. You will have to chose one bracketing algorithm and one locate algorithm
(note, they are useful only in pairs). Also you will have to manually provide a lot of parameters (tolerance, maximum cycles etc)
which can dramatically change the algorithm performance
- Bracketing algorithms - these methods find an interval where at least one extrema of a continuous function exists
- Acceleration bracketing - this method can be used with any continuous functions
- Parabolic extrapolation bracketing - gives better results than acceleration bracketing for
a large class of functions (functions that are locally parabolic about the extrema)
- Acceleration bracketing for derivable functions - requires derivatives to be known; it's slower than the
general acceleration algorithm but also safer
- Locate algorithms - these methods converge to the extrema if the extrema is bracketed and the function under
consideration is continuous
- Parabolic interpolation locate - very fast algorithm but with moderate accuracy
- Linear locate - slow algorithm but exhibits stable convergence
- Brent locate - medium speed with good accuracy. With a good balance of speed and accuracy, this algorithm is very efficient to use
- Cubic interpolation locate - very fast algorithm with reasonable accuracy; requires the derivatives to be known}
- Brent method for derivable functions - medium speed and good accuracy but requires derivatives to be known
- Accurate `high level' algorithms - these algorithms are easy to use and offer high accuracy but are also very slow compared
with the `low 'level' algorithms above (1,000 to 10,000 times slower). Use these algorithms when you need reliable results. The probability for a `high level'
algorithm to make a mistake is much less than that of `low level' algorithms.
- Method for continuous functions
- Method for derivable functions
- Global unidimensional optimization - finds global minima / maxima.
- Methods for continuous functions
- Methods for derivable functions
- Unconstrained local multidimensional optimization
- Methods for general functions - these algorithms do not require continuous functions
- Downhill simplex method of Nelder and Mead - minimizes the function over a sequence of equal volume simplexes
- Methods for continuous functions - these algorithms require the function to be continuous
- Conjugate direction algorithms - this algorithm searches by iterating along conjugate paths
- Powell's method - an implementation of the conjugate direction algorithm
- Methods for derivable functions - these algorithms require the gradient of the function to be known
- Steepest descent - a classical method with poor results, this method should mainly be used for testing purposes
- Conjugate gradient algorithms - speed and accuracy highly dependent on the particular function, these methods can be
deceived by `valleys' in the N-dimensional space
- Fletcher-Reeves - an implementation of the conjugate gradient method
- Polak-Riviere - an implementation of the conjugate gradient method
- Variable metric algorithms/Quasi-Newton algorithms - slow speed; good results on a large class of continuous functions.
The basic idea is to find the sequence of matrices which converges to the inverse Hessian of the function.
- Fletcher-Powell - an implementation of the variable metric algorithm
- Broyden-Fletcher-Goldfarb-Shanno - an implementation of the variable metric algorithm
- Unconstrained global multidimensional optimization
- Simulated annealing - a technique that has attracted significant attention as suitable for optimizing
problems of large scale, especially ones where a desired global extremum is hidden among many poorer, local extrema
- Constrained optimization for derivable functions with linear constraints
- Rosen's gradient projection algorithm - uses the Kuhn-Tucker conditions as a termination criteria.
- Linear programming - here the functions are linear and the constraints are linear
- Simplex algorithm - Kuenzi, Tszchach and Zehnder implementation of the simplex algorithm for linear programming
- Duality - Construct and solve the dual problem for a given primal linear programming problem.
- Sensitivity Analysis - Study how the location and value of the extremum varies under perturbations of the object
function and parallel shifts of the linear constraints. Sensitivity analysis of the boundaries can very efficient be carried
out with the application a duality techniques.
- Sensitivity Analysis - Stability of the value and location of the extremum
- General Framework - Perform sensitivity analysis on any optimization problem/algorithm combination.
- Flexibility - Perform sensitivity analysis on the object function, constraints and/or algorithm.
This product also contains the following features:
- GUI Bundle - we bundle a suite of graphical user interface
JavaBean components (with 1, 2, 4 or site-wide license) allowing the
developer to plug-in a wide range of GUI functionality (including
charts/graphs) into their client applications
- EAR Files - we provide individual customized EAR files for
the most widely used application servers including IBM WebSphere 4.0/5.0,
BEA WebLogic 6.1/7.0, Oracle 9iAS, Sun ONE AppServer 7, Ironflare Orion
1.5.2/1.6.0, Borland AppServer 5.0, Sybase EAServer 3.6 and JBoss 2.4.4/3.0.0
- Self-Deploy - the relevant servers EAR file will be self-deployed
onto supported local application servers during the installation of the
self-install package. The supported application servers include IBM WebSphere
4.0/5.0, BEA WebLogic 6.1/7.0, Oracle 9iAS, Borland AppServer 5.0, Ironflare
Orion 1.5.2/1.6.0 and JBoss 2.4.4/3.0.0
- UML Models - to assist system architects we provide UML
diagrams of this component
|
|
|
|
| Sponsored Links - please visit our sponsors |
| Java FTP Component | | Easily add FTP to your Java apps. | | http://www.jscape.com/inetfactory/ftp.html |
| Secure FTP Applet | | Connect to FTP securely from within your browser. | | http://www.jscape.com/sftpapplet/ |
| Java SMTP Component | | Easily add SMTP to your Java apps | | http://www.jscape.com/inetfactory/smtp.html |
| Learn Java Server Faces! | | Use WebGalileo Faces JSF components to quickly create Java based web apps. | | http://www.jscape.com/webgalileofaces/ |
Sponsor this site
| |
|
|
