Global and Convex Optimization in Modeling Environments: Compiler-Based, Excel, and Mathematica Implementations
نویسنده
چکیده
We present a review of several software products that serve to analyze and solve highly nonlinear—specifically including global—optimization problems across different hardware and software platforms. The implementations discussed are LGO, as a stand-alone, but compiler-dependent modeling and solver environment; its Excel platform implementation; and MathOptimizer, a native solver package for Mathematica users. The discussion advocates the use of hybrid solution strategies, in the context of practical global optimization. Several non-trivial illustrative applications, taken from the literature or received from users of our software products, are also reviewed.
منابع مشابه
Nonlinear Optimization in Mathematica with MathOptimizer Professional
The MathOptimizer Professional software package combines Mathematica’s modeling capabilities with an external solver suite for general nonlinear – global and local – optimization. Optimization models formulated in Mathematica are directly transferred along to the solver engine; the results are seamlessly returned to the calling Mathematica document. This approach combines the advantages of a hi...
متن کاملModified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملParticle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems
The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...
متن کاملGeneral Ellipse Packings in an Optimized Circle Using Embedded Lagrange Multipliers
The general ellipse packing problem is to find a non-overlapping arrangement of n ellipses with (in principle) arbitrary size and orientation parameters inside a given type of container set. Here we consider the general ellipse packing problem with respect to an optimized circle container with minimal radius. Following the review of selected topical literature, we introduce a new model formulat...
متن کامل