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.
Neural optimization machine: a neural network approach for optimization and its application in additive manufacturing with physics-guided learning
PDF) On q-BFGS algorithm for unconstrained optimization problems
Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization
Equality-Constrained Engineering Design Optimization Using a Novel Inexact Quasi-Newton Method
On q-steepest descent method for unconstrained multiobjective optimization problems
Fractal Fract, Free Full-Text
Chapter 4 Line Search Descent Methods Introduction to Mathematical Optimization
Single-Objective Optimization Problem - an overview
Chapter 2-1.pdf
de
por adulto (o preço varia de acordo com o tamanho do grupo)
)
