Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
From MaRDI portal
Publication:6561498
DOI10.23952/JNVA.8.2024.4.09MaRDI QIDQ6561498FDOQ6561498
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)
multiobjective optimizationnonmonotone line searchPareto critical pointrobust approachmemory gradient direction
Cites Work
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Title not available (Why is that?)
- A Nonmonotone Line Search Technique for Newton’s Method
- Approximate proximal methods in vector optimization
- Survey of multi-objective optimization methods for engineering
- Steepest descent methods for multicriteria optimization.
- A projected gradient method for vector optimization problems
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Newton's method for multiobjective optimization
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Multi-objective machine learning
- On the choice of parameters for the weighting method in vector optimization
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- Global convergence of a memory gradient method for unconstrained optimization
- Vector variational inequalities and vector optimization. Theory and applications
- A new variant of the memory gradient method for unconstrained optimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- A new scalarization technique and new algorithms to generate Pareto fronts
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption
- Memory gradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
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)