Tracing Locally Pareto-Optimal Points by Numerical Integration
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 27 May 2020Accepted: 18 2021Published online: 21 September 2021Keywordsbiobjective optimization, scalarization, Pareto tracing, shape optimizationAMS Subject Headings90B50, 34A12, 49Q10, 65C50, 60G55Publication DataISSN (print): 0363-0129ISSN (online): 1095-7138Publisher: Society for Industrial and Applied MathematicsCODEN: sjcodc
منابع مشابه
Choosing integration points for QCD calculations by numerical integration
I discuss how to sample the space of parton momenta in order to best perform the numerical integrations that lead to a calculation of three jet cross sections and similar observables in electron-positron annihilation. Typeset using REVTEX
متن کاملTriangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold angle α, the Delaunay refinement algorithms compute triangulations that have all angles at least α. Our algorithms have the same theoretical guarantees as the previous Delaunay refinement algorithms. The original Delauna...
متن کاملAsymptotically Optimal Weighted Numerical Integration
We study numerical integration of H older{type functions with respect to weights on the real line. Our study extends previous work by F. Curbera, [2] and relies on a connection between this problem and the approximation of distribution functions by empirical ones. The analysis is based on a lemma which is important within the theory of optimal designs for approximating stochastic processes. As...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملOptimal algorithms for numerical integration: a survey
We discuss optimality of approximation algorithms and lower bounds on their complexity using Carl’s inequality, which states that for any two Banach spaces X and Y and any α > 0 there exists a constant γα > 0 such that sup 1≤k≤n kek(T ) ≤ γα sup 1≤k≤n kck(T ) holds for all linear and bounded operators T : X → Y . Here ek(T ) is the k-th entropy number of T and ck(T ) is the k-th Gelfand number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Control and Optimization
سال: 2021
ISSN: ['0363-0129', '1095-7138']
DOI: https://doi.org/10.1137/20m1341106