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.

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

Full article: An incremental descent method for multi-objective optimization

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

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

PDF] The q-gradient method for global optimization

Unconstrained Nonlinear Optimization Algorithms - MATLAB & Simulink

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

Full article: An incremental descent method for multi-objective optimization

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems