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.
A reliability‐cost optimisation model for maintenance scheduling of wastewater treatment's power generation engines - Gorjian Jolfaei - 2022 - Quality and Reliability Engineering International - Wiley Online Library
ICLR2022 Statistics
PDF] The q-gradient method for global optimization
Accelerated Diagonal Steepest Descent Method for Unconstrained 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
Full article: Complexity of gradient descent for multiobjective optimization
A hybrid conjugate gradient method for optimization problems
Unconstrained Nonlinear Optimization Algorithms - MATLAB & Simulink
Chapter 2-1.pdf
On q-steepest descent method for unconstrained multiobjective optimization problems. - Document - Gale Academic OneFile
Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization
de
por adulto (o preço varia de acordo com o tamanho do grupo)
