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.

Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization

On q-steepest descent method for unconstrained multiobjective optimization problems

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

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

Unconstrained Optimization Problem - ppt video online download

Solved I. Solve the following utility maximization problem

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

Optimization of Engineering Systems Tutorial

Chapter 2-1.pdf

On q-steepest descent method for unconstrained multiobjective optimization problems

Lecture 38 - Multivariable Unconstrained Optimization, Steepest Descent Method

PDF] The q-gradient method for global optimization