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.
Optimization of Engineering Systems Tutorial
What Is Optimization Toolbox?
A Kriging-based global optimization method using multi-points infill search criterion - Li Yaohui, 2017
On q-BFGS algorithm for unconstrained optimization problems, Advances in Continuous and Discrete Models
Solved I. Solve the following utility maximization problem
Introduction to Optimization Constraints with SciPy, by Nicolo Cosimo Albanese
PDF) On q-steepest descent method for unconstrained multiobjective optimization problems
20 Best Optimization Books of All Time - BookAuthority
Unconstrained Optimization Problem - ppt video online download
Restricted-Variance Molecular Geometry Optimization Based on Gradient-Enhanced Kriging
