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

Mathematical optimization - Wikiwand

Performance of q-Steepest Descent Method.

Unconstrained Optimization Problem - ppt video online download

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

Lecture 38 - Multivariable Unconstrained Optimization, Steepest Descent Method

Restricted-Variance Molecular Geometry Optimization Based on Gradient-Enhanced Kriging

Cooperative and Competitive Multi-Agent Systems: From Optimization to Games

Particle Swarm Optimization with a Simplex Strategy to Avoid Getting Stuck on Local Optimum

Equality-Constrained Engineering Design Optimization Using a Novel Inexact Quasi-Newton Method

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

A reliability‐cost optimisation model for maintenance scheduling of wastewater treatment's power generation engines - Gorjian Jolfaei - 2022 - Quality and Reliability Engineering International - Wiley Online Library