Nonconvex Pareto Navigator
Interactive Nonconvex Pareto Navigator for multiobjective optimization. We introduce a new interactive multiobjective optimization method operating in the objective space called Nonconvex Pareto Navigator. It extends the Pareto Navigator method for nonconvex problems. An approximation of the Pareto optimal front in the objective space is first generated with the PAINT method using a relatively small set of Pareto optimal outcomes that is assumed to be given or computed prior to the interaction with the decision maker. The decision maker can then navigate on the approximation and direct the search for interesting regions in the objective space. In this way, the decision maker can conveniently learn about the interdependencies between the conflicting objectives and possibly adjust one’s preferences. To facilitate the navigation, we introduce special cones that enable extrapolation beyond the given Pareto optimal outcomes. Besides handling nonconvexity, the new method contains new options for directing the navigation that have been inspired by the classification-based interactive NIMBUS method. The Nonconvex Pareto Navigatormethod is especially well-suited for computationally expensive problems, because the navigation on the approximation is computationally inexpensive. We demonstrate the method with an example. Besides proposing the new method, we characterize interactive navigation based methods in general and discuss desirable properties of navigation methods overall and in particular with respect to Nonconvex Pareto Navigator.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Hartikainen, Markus; Miettinen, Kaisa; Klamroth, Kathrin: Interactive \textscNonconvexPareto Navigator for multiobjective optimization (2019)
- Ruiz, Ana B.; Ruiz, Francisco; Miettinen, Kaisa; Delgado-Antequera, Laura; Ojalehto, Vesa: NAUTILUS navigator: free search interactive multiobjective optimization without trading-off (2019)