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.
PDF) On q-steepest descent method for unconstrained multiobjective optimization problems
A Gradient-Based Search Method for Multi-objective Optimization Problems - ScienceDirect
Full article: Complexity of gradient descent for multiobjective optimization
Geometry optimization - Schlegel - 2011 - WIREs Computational Molecular Science - Wiley Online Library
Optimization of Complex Systems: Theory, Models, Algorithms and Applications, PDF, Mathematical Optimization
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
Single-Objective Optimization Problem - an overview
Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization
Particle Swarm Optimization with a Simplex Strategy to Avoid Getting Stuck on Local Optimum
ICLR2022 Statistics
Cooperative and Competitive Multi-Agent Systems: From Optimization to Games
Introduction to Optimization Constraints with SciPy, by Nicolo Cosimo Albanese
Unconstrained Nonlinear Optimization Algorithms - MATLAB & Simulink
Constrained Engineering Optimization Algorithm Based on Elite Selection – topic of research paper in Mathematics. Download scholarly article PDF and read for free on CyberLeninka open science hub.
de
por adulto (o preço varia de acordo com o tamanho do grupo)
