An inexact nonmonotone projected gradient method for constrained multiobjective optimization

Cites work

scientific article; zbMATH DE number 439380 (Why is no real title available?)
scientific article; zbMATH DE number 47208 (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 multicriteria approach to the location of public facilities
A new nonmonotone line search technique for unconstrained optimization
A projected gradient method for vector optimization problems
A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
A relaxed projection method for solving multiobjective optimization problems
A steepest descent method for vector optimization
An inexact scalarization proximal point method for multiobjective quasiconvex minimization
Complexity of gradient descent for multiobjective optimization
Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
Convergence of the projected gradient method for quasiconvex multiobjective optimization
Convex Analysis
Full convergence of the steepest descent method with inexact line searches
Inexact projected gradient method for vector optimization
Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
Multiobjective optimization: a brief overview
Newton's method for multiobjective optimization
Nonmonotone gradient methods for vector optimization with a portfolio optimization application
On Projection Algorithms for Solving Convex Feasibility Problems
On the choice of parameters for the weighting method in vector optimization
On the convergence of the projected gradient method for vector optimization
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
Steepest descent methods for multicriteria optimization.
The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
The self regulation problem as an inexact steepest descent method for multicriteria 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)