Aug 1, 2008 · The method does not rely on an “a priori” scalarization and is based on a dynamic system defined by a vector field of descent directions in the ...
The method does not rely on an ''a priori'' scalarization and is based on a dynamic system defined by a vector field of descent directions in the considered box ...
The method does not rely on an “a priori” scalarization and is based on a dynamic system defined by a vector field of descent directions in the considered box.
By E. Miglierina, E. Molho and Maria Recchioni; Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization.
Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization. Author & abstract; Download; 5 References; 11 Citations ...
The method does not rely on an “a priori” scalarization and is based on a dynamic system defined by a vector field of descent directions in the considered box.
Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812). From MaRDI portal.
The algorithm finds the critical points as limit points of a suitable dynamical system and it does not rely on an a priori scalarization of the vector objective ...
People also ask
What is the constraint method for multi-objective optimization?
Which method is commonly used in multi-objective optimization to convert a multi-objective problem into a single-objective problem?
What are the methods of multiobjective optimization?
What is the difference between multi-objective optimization and many objective optimization?
Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization · Mathematics, Computer Science. European Journal of ...
Algorithm A1 is a kind of interior point method for vec- tor optimization problems that does not require any “a priori” scalarization of the objectives Fi ...