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.

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization 3030429490, 9783030429492

PDF) On q-steepest descent method for unconstrained multiobjective optimization problems

Unconstrained Optimization Problem - ppt video online download

Single-Objective Optimization Problem - an overview

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

A Gradient-Based Search Method for Multi-objective Optimization Problems - ScienceDirect

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

Mathematical optimization for supply chain - Lecture 4.3

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

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

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

Mathematics, Free Full-Text

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