On q-steepest descent method for unconstrained multiobjective optimization problems

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] The q-gradient method for global optimization

Neural Architecture Search: Insights from 1000 Papers – arXiv Vanity

On q-steepest descent method for unconstrained multiobjective optimization problems

Single-Objective Optimization Problem - an overview

PDF) A Steepest Descent Method for Set Optimization Problems with Set-Valued Mappings of Finite Cardinality

Solved I. Solve the following utility maximization problem

Mathematics, Free Full-Text

A Kriging-based global optimization method using multi-points infill search criterion - Li Yaohui, 2017

Stabilization of the fluidic pinball with gradient-enriched machine learning control, Journal of Fluid Mechanics

What is the idea beind the optimization problems? - Quora

Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization