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.
SciELO - Brasil - A SURVEY ON MULTIOBJECTIVE DESCENT METHODS A SURVEY ON MULTIOBJECTIVE DESCENT METHODS
Solving Optimization Problems using the Matlab Optimization
On q-BFGS algorithm for unconstrained optimization problems, Advances in Continuous and Discrete Models
Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization
PDF] The q-gradient method for global optimization
Optimization of Complex Systems: Theory, Models, Algorithms and Applications, PDF, Mathematical Optimization
PDF] Newton's Method for Multiobjective Optimization
On q-steepest descent method for unconstrained multiobjective optimization problems
On q-steepest descent method for unconstrained multiobjective optimization problems. - Document - Gale Academic OneFile
de
por adulto (o preço varia de acordo com o tamanho do grupo)
/cdn.vox-cdn.com/uploads/chorus_asset/file/19233918/TLOUPII_DEMO_SCREEN_10.jpg)
