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.
Chapter 4 Line Search Descent Methods Introduction to Mathematical Optimization
Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization
Full article: Complexity of gradient descent for multiobjective optimization
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
Neural optimization machine: a neural network approach for optimization and its application in additive manufacturing with physics-guided learning
A hybrid conjugate gradient method for optimization problems
On q-steepest descent method for unconstrained multiobjective optimization problems
SciELO - Brasil - A SURVEY ON MULTIOBJECTIVE DESCENT METHODS A SURVEY ON MULTIOBJECTIVE DESCENT METHODS
PDF] The q-gradient method for global optimization
ICLR2022 Statistics
PDF] Newton's Method for Multiobjective Optimization
On q-BFGS algorithm for unconstrained optimization problems, Advances in Continuous and Discrete Models
Introducing a novel algorithm for minimum-time low-thrust orbital transfers with free initial condition - I Shafieenejad, AB Novinzadeh, VR Molazadeh, 2015
de
por adulto (o preço varia de acordo com o tamanho do grupo)
