On q-steepest descent method for unconstrained multiobjective optimization problems
Por um escritor misterioso
Descrição
The <i>q</i>-gradient is the generalization of the gradient based on the <i>q</i>-derivative. The <i>q</i>-version of the steepest descent method for unconstrained multiobjective optimization problems is constructed and recovered to the classical one as <i>q</i> equals 1. In this method, the search process moves step by step from global at the beginning to particularly neighborhood at last. This method does not depend upon a starting point. The proposed algorithm for finding critical points is verified in the numerical examples.
On q-steepest descent method for unconstrained multiobjective optimization problems. - Document - Gale Academic OneFile
Self-directed online machine learning for topology optimization
Fractal Fract, Free Full-Text
PDF) A Steepest Descent Method for Set Optimization Problems with Set-Valued Mappings of Finite Cardinality
20 Best Optimization Books of All Time - BookAuthority
PDF] The q-gradient method for global optimization
Full article: An incremental descent method for multi-objective optimization
Chapter 4 Line Search Descent Methods Introduction to Mathematical Optimization
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
Performance of q-Steepest Descent Method.
Single-Objective Optimization Problem - an overview
de
por adulto (o preço varia de acordo com o tamanho do grupo)
