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
Frontiers Superiorization of projection algorithms for linearly constrained inverse radiotherapy treatment planning
X Brazilian Workshop on Continuous Optimization IMPA - Instituto de Matemática Pura e Aplicada
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization 3030429490, 9783030429492
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
Mathematics, Free Full-Text
Constrained Engineering Optimization Algorithm Based on Elite Selection – topic of research paper in Mathematics. Download scholarly article PDF and read for free on CyberLeninka open science hub.
Chapter 4 Line Search Descent Methods Introduction to Mathematical Optimization
Full article: Complexity of gradient descent for multiobjective optimization
On q-steepest descent method for unconstrained multiobjective optimization problems. - Document - Gale Academic OneFile
PPT - Part II.2 A-Posteriori Methods and Evolutionary Multiobjective Optimization PowerPoint Presentation - ID:1089891
Stabilization of the fluidic pinball with gradient-enriched machine learning control, Journal of Fluid Mechanics
de
por adulto (o preço varia de acordo com o tamanho do grupo)
