Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.01362 v1 pith:XARTYYTG submitted 2022-08-02 math.OC

An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation

classification math.OC
keywords adaptivemethodmulti-objectiveoptimizationspaceanalyzedapproximationconsensus
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this work we are interested in stochastic particle methods for multi-objective optimization. The problem is formulated using parametrized, single-objective sub-problems which are solved simultaneously. To this end a consensus based multi-objective optimization method on the search space combined with an additional heuristic strategy to adapt parameters during the computations is proposed. The adaptive strategy aims to distribute the particles uniformly over the image space by using energy-based measures to quantify the diversity of the system. The resulting metaheuristic algorithm is mathematically analyzed using a mean-field approximation and convergence guarantees towards optimal points is rigorously proven. In addition, a gradient flow structure in the parameter space for the adaptive method is revealed and analyzed. Several numerical experiments shows the validity of the proposed stochastic particle dynamics and illustrate the theoretical findings.

discussion (0)

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