An inexact nonmonotone projected gradient method for constrained multiobjective optimization
From MaRDI portal
Publication:6561493
DOI10.23952/JNVA.8.2024.4.03MaRDI QIDQ6561493
Xiaopeng Zhao, Yonghong Yao, Huijie Zhang
Publication date: 25 June 2024
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A multicriteria approach to the location of public facilities
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Steepest descent methods for multicriteria optimization.
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A relaxed projection method for solving multiobjective optimization problems
- A steepest descent method for vector optimization
- 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
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- Inexact projected gradient method for vector optimization
- On the choice of parameters for the weighting method in vector optimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- On the convergence of the projected gradient method for vector optimization
- Newton's Method for Multiobjective Optimization
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- 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
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- Full convergence of the steepest descent method with inexact line searches
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- Complexity of gradient descent for multiobjective optimization
- Convex Analysis
- A new nonmonotone line search technique for unconstrained optimization
This page was built for publication: An inexact nonmonotone projected gradient method for constrained multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561493)