Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach

DOI10.23952/JNVA.8.2024.4.09MaRDI QIDQ6561498zbMATH OpenFDO

Authors Yushan Bai, Jiawei Chen, Liping Tang, Tao Zhang

Publication date 25 June 2024

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

zbMATH Keywords

multiobjective optimizationnonmonotone line searchPareto critical pointrobust approachmemory gradient direction

Mathematics Subject Classification ID

Functional analysis (46-XX) Operator theory (47-XX)

Cites work

• scientific article; zbMATH DE number 2063780 (Why is no real title available?)
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
• A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption
• A linear scalarization proximal point method for quasiconvex multiobjective minimization
• A new scalarization technique and new algorithms to generate Pareto fronts
• A new variant of the memory gradient method for unconstrained optimization
• A nonmonotone gradient method for constrained multiobjective optimization problems
• A nonmonotone supermemory gradient algorithm for unconstrained optimization
• A projected gradient method for vector optimization problems
• A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
• A scalarization proximal point method for quasiconvex multiobjective minimization
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization
• Approximate proximal methods in vector optimization
• Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
• Global convergence of a memory gradient method for unconstrained optimization
• Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
• Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
• Memory gradient method for multiobjective optimization
• Multi-objective machine learning
• Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
• Newton's method for multiobjective optimization
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application
• Nonmonotone line searches for unconstrained multiobjective optimization problems
• OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
• On the choice of parameters for the weighting method in vector optimization
• Steepest descent methods for multicriteria optimization.
• Survey of multi-objective optimization methods for engineering
• The self regulation problem as an inexact steepest descent method for multicriteria optimization
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• Vector variational inequalities and vector optimization. Theory and applications

This page was built for publication: Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561498)