A nonmonotone gradient method for constrained multiobjective optimization problems

DOI10.23952/jnva.6.2022.6.07OpenAlexW4312940312MaRDI QIDQ5052584

Yonghong Yao, Xiaopeng Zhao, Jen-Chih Yao

Publication date: 25 November 2022

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

Full work available at URL: https://doi.org/10.23952/jnva.6.2022.6.07

zbMATH Keywords

multiobjective optimizationPareto optimalitylinear convergencegradient methodnonmonotone line search

Mathematics Subject Classification ID

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

Related Items

A new class of computationally efficient algorithms for solving fixed-point problems and variational inequalities in real Hilbert spaces ⋮ An approximation method for variational inequality with uncertain variables

Cites Work

• Unnamed Item
• Unnamed Item
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• Convergence of the projected gradient method for quasiconvex multiobjective optimization
• Multiobjective optimization. Interactive and evolutionary approaches
• Steepest descent methods for multicriteria optimization.
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application
• A relaxed projection method for solving multiobjective optimization problems
• A projected gradient method for vector optimization problems
• A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
• Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
• The self regulation problem as an inexact steepest descent method for multicriteria optimization
• Nonmonotone line searches for unconstrained multiobjective optimization problems
• A linear scalarization proximal point method for quasiconvex multiobjective minimization
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
• Approximate proximal methods in vector optimization
• On the choice of parameters for the weighting method in vector optimization
• Vector optimization. Set-valued and variational analysis.
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization
• Vector Optimization
• Newton's Method for Multiobjective Optimization
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Variational Analysis
• A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
• The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Full convergence of the steepest descent method with inexact line searches
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• Complexity of gradient descent for multiobjective optimization
• Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
• A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
• Convex Analysis
• A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
• On the nonmonotone line search

This page was built for publication: A nonmonotone gradient method for constrained multiobjective optimization problems