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.
Stabilization of the fluidic pinball with gradient-enriched machine learning control, Journal of Fluid Mechanics
An Efficient Hybrid Algorithm for Multiobjective Optimization Problems with Upper and Lower Bounds in Engineering
Classification of optimization Techniques
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
Introduction to Optimization Constraints with SciPy, by Nicolo Cosimo Albanese
X Brazilian Workshop on Continuous Optimization IMPA - Instituto de Matemática Pura e Aplicada
On q-steepest descent method for unconstrained multiobjective optimization problems
Frontiers Superiorization of projection algorithms for linearly constrained inverse radiotherapy treatment planning
Mathematics, Free Full-Text
On q-steepest descent method for unconstrained multiobjective optimization problems. - Document - Gale Academic OneFile
Neural Architecture Search: Insights from 1000 Papers – arXiv Vanity
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
Geometry optimization - Schlegel - 2011 - WIREs Computational Molecular Science - Wiley Online Library
de
por adulto (o preço varia de acordo com o tamanho do grupo)
