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.

Convex Function: Most Up-to-Date Encyclopedia, News & Reviews

PDF) On q-BFGS algorithm for unconstrained optimization problems

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

An Efficient Hybrid Algorithm for Multiobjective Optimization Problems with Upper and Lower Bounds in Engineering

Effective multi-objective inverse lithography technology at full-field and full-chip levels with a hybrid dynamic priority algorithm

ICLR2022 Statistics

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

Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization

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

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