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.

On q-steepest descent method for unconstrained multiobjective optimization problems

Fractal Fract, Free Full-Text

Classification of optimization Techniques

ICLR2022 Statistics

On q-steepest descent method for unconstrained multiobjective optimization problems

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization 3030429490, 9783030429492

PDF] The q-gradient method for global optimization

Optimization of Complex Systems: Theory, Models, Algorithms and Applications, PDF, Mathematical Optimization

Recent Advances in Bayesian Optimization