pith. sign in

arxiv: 1505.02899 · v1 · pith:Z2XV62PCnew · submitted 2015-05-12 · 🧮 math.OC

A Homotopy Method for Large-Scale Multi-Objective Optimization

classification 🧮 math.OC
keywords algorithmoptimizationhomotopymethodmulti-objectivenormalpresentedproblems
0
0 comments X
read the original abstract

A homotopy method for multi-objective optimization that produces uniformly sampled Pareto fronts by construction is presented. While the algorithm is general, of particular interest is application to simulation-based engineering optimization problems where economy of function evaluations, smoothness of result, and time-to-solution are critical. The presented algorithm achieves an order of magnitude improvement over other geometrically motivated methods, like Normal Boundary Intersection and Normal Constraint, with respect to solution evenness for similar computational expense. Furthermore, the resulting uniformity of solutions extends even to more difficult problems, such as those appearing in common Evolutionary Algorithm test cases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.