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. - Document - Gale Academic OneFile

Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization

X Brazilian Workshop on Continuous Optimization IMPA - Instituto de Matemática Pura e Aplicada

Lecture 38 - Multivariable Unconstrained Optimization, Steepest Descent Method

Performance of q-Steepest Descent Method.

PDF] The q-gradient method for global optimization

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

Frontiers Superiorization of projection algorithms for linearly constrained inverse radiotherapy treatment planning

Recent Advances in Bayesian Optimization

Fractal Fract, Free Full-Text

PPT - Part II.2 A-Posteriori Methods and Evolutionary Multiobjective Optimization PowerPoint Presentation - ID:1089891

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

Solved 2. Steepest descent for unconstrained quadratic

SciELO - Brasil - A SURVEY ON MULTIOBJECTIVE DESCENT METHODS A SURVEY ON MULTIOBJECTIVE DESCENT METHODS

On q-steepest descent method for unconstrained multiobjective optimization problems. - Document - Gale Academic OneFile