Optimization is a process of finding the values of model parameters (design variables), which lead to the best performance of model under investigation. Model performance is quantified in terms of several fitness functions constructed from measured or simulated model responses.

pSeven offers a variety of methods to conduct optimization of one or multiple model performance criteria subject to various constraints. It allows to efficiently solve both engineering optimization problems with cheap to evaluate semi-analytical models and the problems where the key challenge is expensive (in terms of computing resources) evaluations of objective functions and constraints. pSeven provides a smart optimization manager, which automatically selects the most suitable optimization algorithm for a given optimization problem from a pool of powerful optimization methods and algorithms. This allows addressing a wide range of applications.

For any type of optimization problem, methods implemented in pSeven are the most efficient in terms of required number of model evaluations. Other criteria, such as CPU time, are considered to be of lower priority.

The efficiency of optimization problem solution highly depends on proper algorithm selection. With pSeven, the user has to simply set the basic properties of the model (such as model evaluation expensiveness, smoothness of model responses, expected degree of multi-modality, etc.) instead of tedious tuning of optimization algorithm internal parameters. The automatic and adaptive choice of specific optimization algorithm(s) based on this information is provided by SmartSelection™ technology.

Along with the automatic algorithms selection convenient for the users, full control over the whole optimization process is available for expert-level users, making optimization capabilities of pSeven highly customizable.

In addition to the complete in-house development of mathematical methods, pSeven development team reuses popular and well-known implementations of optimization algorithms and supplements them with in-house developed features, which makes them the most efficient and unique.

pSeven optimization algorithms are specifically developed for real-life industrial applications. They are robust to numerical noise in model response and stable with respect to occasional undefined model behavior. Several optimal solution candidates are always provided instead of one. Thus, the user avoids solving the same problem repeatedly if the proper formulation is found later, and saves computational resources.

A formal definition of optimization problem solved by pSeven optimizer (this formulation does not concern robust optimization cases):

\begin{array}{cl}\min\limits_x \, f^i(x) & i=1,…,K & \\ c^j_L \,\le\, c^j(x)\,\le\, c^j_U & j=1,…,M \\x^k_L \,\le\, x^k\,\le\, x^k_U & k=1,…,N\end{array}

* N* - number of design variables that can be subject to upper and lower bounds (box bounds)

* K * - number of criteria (objective functions) to consider

* M *- number of (functional) constraints defining the feasible domain, excluding box bounds on design variables.

Main classes of problems, which are supported in pSeven (but not limited by this list) are summarized in the table below (numbers are approximate):

Type of problem | N | K | M |
---|---|---|---|

Linear problems (including mixed-integer linear problems | O(10^{6}) |
1 [linear] | O(10^{6}) [linear] |

Quadratic indefinite problems | O(10^{4}) |
1 [quadratic] | O(10^{4}) [linear] |

Unconstrained single-objective problems | O(10^{4}) |
1 | 0 |

Constrained single-objective problems | O(10^{4}) |
1 | O(10^{4}) |

Constraints satisfaction problems | O(10^{4}) |
0 | O(10^{4}) |

Multi-objective constrained optimization problems | O(10^{4}) |
O(10) | O(10^{4)} |

Computationally expensive problems | O(10) | O(1) | O(10) |

*Within this table, relevant problem data (objectives/constraints) are assumed to be generic non-linear (albeit sufficiently regular) functions unless other information is provided (primarily via hints mechanism described here). Note that characteristic dimensionalities cited above are estimated conservatively, for instance, the number of design variables in computationally intensive problems might be as large as 100.*

Efficient solution of these problems requires implementing of the variety of numerical algorithms. A brief summary of selected numerical methods implemented in pSeven to solve optimization problems is given below.

The family of optimization strategies based on surrogate modeling is proven to be the most effective in the majority of engineering applications. Surrogate-based optimization in pSeven supports all types of problems, including multi-objective robust formulations.

Mixed-integer black-box optimization is acknowledged as much more complex than a continuous one. pSeven provides this capability based on surrogate modeling approach, which covers all types of problems mentioned above, including robust formulations. Special optimization algorithms are implemented for mixed-integer linear problems.

More detailed list and description of methods available in pSeven can be found here.

Thanks to powerful workflow engine pSeven support various types of multidisciplinary optimization strategies, including bi-level optimization, collaborative optimization, analytical target cascading and many others.

- Efficient solution of complex engineering problems with up to ten criteria, hundreds of design variables and constraints within a short timeframe.
- Parallel execution of optimization procedures, allowing to greatly reduce computational time of resource-consuming problems solution.
- Robustness of optimization process to random noise presents in model responses, as well as to sporadic undefined model behavior.
- A wide range of easy-to-use proprietary optimization algorithms with a minimum setup required.
- Built-in mechanism of automatic method selection, allowing users with no specialized competence to successfully solve optimization tasks.