A nonmonotone Polak-Ribière-Polyak conjugate gradient method for multiobjective optimization problems
From MaRDI portal
Cites work
- A conjugate directions-type procedure for quadratic multiobjective optimization
- A modified Polak-Ribière-Polyak type conjugate gradient method for vector optimization
- A modified PRP conjugate gradient method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A nonmonotone gradient method for constrained multiobjective optimization problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A novel hybrid conjugate gradient method for multiobjective optimization problems
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- A study of Liu-Storey conjugate gradient methods for vector optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- An adaptive nonmonotone line search for multiobjective optimization problems
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Benchmarking optimization software with performance profiles.
- Convergence of Liu-Storey conjugate gradient method
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient nonlinear conjugate gradient techniques for vector optimization problems
- Function minimization by conjugate gradients
- Generalized homotopy approach to multiobjective optimization.
- Globally convergent Newton-type methods for multiobjective optimization
- scientific article; zbMATH DE number 4141383 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Multiobjective conjugate gradient methods on Riemannian manifolds
- Newton's method for multiobjective optimization
- Nonlinear conjugate gradient methods for unconstrained 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
- Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
- Nonmonotone Wolfe-type quasi-Newton methods for multiobjective optimization problems
- On the Dai–Liao conjugate gradient method for vector optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Solving multiobjective optimization problems using artificial bee colony algorithm
- Steepest descent methods for multicriteria optimization.
- Step-size estimation for unconstrained optimization methods
- The conjugate gradient method in extremal problems
- The Dai–Liao-type conjugate gradient methods for solving vector optimization problems
This page was built for publication: A nonmonotone Polak-Ribière-Polyak conjugate gradient method for multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314221)