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) On q-steepest descent method for unconstrained multiobjective optimization problems

A Particle Swarm Optimization Algorithm with Gradient Perturbation and Binary Tree Depth First Search Strategy

What is the idea beind the optimization problems? - Quora

A Gradient-Based Search Method for Multi-objective Optimization Problems - ScienceDirect

A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems, Journal of Inequalities and Applications

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization 3030429490, 9783030429492

Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization

Recent Advances in Bayesian Optimization

PDF) On q-BFGS algorithm for unconstrained optimization problems

Fractal Fract, Free Full-Text

PDF] The q-gradient method for global optimization

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

A Gradient-Based Search Method for Multi-objective Optimization Problems - ScienceDirect

Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization - ScienceDirect

Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming