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.
Mathematical optimization - Wikiwand
On q-steepest descent method for unconstrained multiobjective optimization problems
Performance of q-Steepest Descent Method.
Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
PDF) On q-BFGS algorithm for unconstrained optimization problems
Effective multi-objective inverse lithography technology at full-field and full-chip levels with a hybrid dynamic priority algorithm
Single-Objective Optimization Problem - an overview
Particle Swarm Optimization with a Simplex Strategy to Avoid Getting Stuck on Local Optimum
Full article: An incremental descent method for multi-objective optimization
de
por adulto (o preço varia de acordo com o tamanho do grupo)
