نتایج جستجو برای: scalarization techniques

تعداد نتایج: 628843  

2000
Gerald Roth

One task of all Fortran 90 compilers is to scalarize the array syntax statements of a program into equivalent sequential code. Most compilers require multiple passes over the program source to ensure correctness of this translation, since their analysis algorithms only work on the scalarized form. These same compilers then make additional subsequent passes to perform loop optimizations such as ...

Journal: :Journal of Applied Mathematics and Physics 2022

This paper introduces the Lagrangian relaxation method to solve multiobjective optimization problems. It is often required use appropriate technique determine multipliers in that leads finding optimal solution problem. Our analysis aims find a suitable generate multipliers, and later these are used Multiobjective We propose search-based Lagrange multipliers. In our paper, we choose well-known s...

2015
Diederik M. Roijers

In decision-theoretic planning problems, such as (partially observable) Markov decision problems [Wiering and Van Otterlo, 2012] or coordination graphs [Guestrin et al., 2002], agents typically aim to optimize a scalar value function. However, in many real-world problems agents are faced with multiple possibly conflicting objectives, e.g., maximizing the economic benefits of timber harvesting w...

2013
PETER A. FORSYTH YUYING LI

A continuous time mean-variance (MV) problem optimizes the bi-objective criteria 5 (V, E), respectively representing variance V and expected value E of a random variable at the end 6 of a time horizon T . This problem is computationally challenging since the dynamic programming 7 principle cannot be directly applied to the variance criterion. An embedding technique has been 8 proposed in [18, 2...

2013
T. Ganesan I. Elamvazuthi Ku Zilati Ku Shaari P. Vasant

Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-bou...

2010
Flávio Teixeira Alexandre R. S. Romariz

This chapter presents the application of a comprehensive statistical analysis for both algorithmic performance comparison and optimal parameter estimation on a multi-objective digital signal processing problem. The problem of designing optimum digital finite impulse response (FIR) filters with the simultaneous approximation of the filter magnitude and phase is posed as a multiobjective optimiza...

Journal: :SIAM J. Control and Optimization 2014
Shu Tong Tse Peter A. Forsyth Yuying Li

A continuous time mean variance (MV) problem optimizes the biobjective criteria (V , E), representing variance V and expected value E, respectively, of a random variable at the end of a time horizon T . This problem is computationally challenging since the dynamic programming principle cannot be directly applied to the variance criterion. An embedding technique has been proposed in [D. Li and W...

Journal: :Journal of High Energy Physics 2020

Journal: :Physics Letters B 2021

We study static and spherically symmetric charged stars with a nontrivial profile of the scalar field $\phi$ in Einstein-Maxwell-scalar theories. The is coupled to $U(1)$ gauge $A_{\mu}$ form $-\alpha(\phi)F_{\mu \nu}F^{\mu \nu}/4$, where $F_{\mu \nu}=\partial_{\mu}A_{\nu}-\partial_{\nu} A_{\mu}$ strength tensor. Analogous case black holes, we show that this type interaction can induce spontane...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید