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.
PPT - Part II.2 A-Posteriori Methods and Evolutionary Multiobjective Optimization PowerPoint Presentation - ID:1089891
A Gradient-Based Search Method for Multi-objective Optimization Problems - ScienceDirect
Energies, Free Full-Text
Solved I. Solve the following utility maximization problem
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems, Journal of Inequalities and Applications
Some Unconstrained Optimization Methods
Chapter 2-1.pdf
PDF] The q-gradient method for global optimization
Mathematics, Free Full-Text
PDF) On q-BFGS algorithm for unconstrained optimization problems
X Brazilian Workshop on Continuous Optimization IMPA - Instituto de Matemática Pura e Aplicada
de
por adulto (o preço varia de acordo com o tamanho do grupo)
