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
Energies, Free Full-Text
On q-steepest descent method for unconstrained multiobjective optimization problems
Fractal Fract, Free Full-Text
Mathematical optimization - Wikiwand
Classification of optimization Techniques
On q-steepest descent method for unconstrained multiobjective optimization problems
On q-steepest descent method for unconstrained multiobjective optimization problems. - Document - Gale Academic OneFile
Chapter 4 Line Search Descent Methods Introduction to Mathematical Optimization
A Gradient-Based Search Method for Multi-objective Optimization Problems - ScienceDirect
de
por adulto (o preço varia de acordo com o tamanho do grupo)
