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.

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

Stabilization of the fluidic pinball with gradient-enriched machine learning control, Journal of Fluid Mechanics

PDF) On q-BFGS algorithm for unconstrained optimization problems

Chapter 4 Line Search Descent Methods Introduction to Mathematical Optimization

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

Introducing a novel algorithm for minimum-time low-thrust orbital transfers with free initial condition - I Shafieenejad, AB Novinzadeh, VR Molazadeh, 2015

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

20 Best Optimization Books of All Time - BookAuthority

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

Introduction to Optimization Constraints with SciPy, by Nicolo Cosimo Albanese

Single-Objective Optimization Problem - an overview