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.

Neural optimization machine: a neural network approach for optimization and its application in additive manufacturing with physics-guided learning

PDF) On q-steepest descent method for unconstrained multiobjective optimization problems

PDF] Newton's Method for Multiobjective Optimization

Classification of optimization Techniques

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

On q-steepest descent method for unconstrained multiobjective optimization problems

Full article: Complexity of gradient descent for multiobjective optimization

Mathematics, Free Full-Text

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