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.

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

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

Mathematics, Free Full-Text

On q-steepest descent method for unconstrained multiobjective optimization problems

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

Fractal Fract, Free Full-Text

Classification of optimization Techniques

Chapter 4 Line Search Descent Methods Introduction to Mathematical Optimization

Geometry optimization - Schlegel - 2011 - WIREs Computational Molecular Science - Wiley Online Library

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

Solved I. Solve the following utility maximization problem

PDF] The q-gradient method for global optimization

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