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.

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

Mathematics, Free Full-Text

ICLR2022 Statistics

X Brazilian Workshop on Continuous Optimization IMPA - Instituto de Matemática Pura e Aplicada

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

Fractal Fract, Free Full-Text

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

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

Solving Optimization Problems using the Matlab Optimization

Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization