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.
20 Best Optimization Books of All Time - BookAuthority
ICLR2022 Statistics
Unconstrained Optimization Problem - ppt video online download
Nelder–Mead method - Wikipedia
PDF] Newton's Method for Multiobjective Optimization
A Gradient-Based Search Method for Multi-objective Optimization Problems - ScienceDirect
Particle Swarm Optimization with a Simplex Strategy to Avoid Getting Stuck on Local Optimum
A Kriging-based global optimization method using multi-points infill search criterion - Li Yaohui, 2017
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
Introduction to Optimization Constraints with SciPy, by Nicolo Cosimo Albanese
Classification of optimization Techniques
Effective multi-objective inverse lithography technology at full-field and full-chip levels with a hybrid dynamic priority algorithm
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
de
por adulto (o preço varia de acordo com o tamanho do grupo)
