Efficient nonlinear conjugate gradient techniques for vector optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Wolfe Line Search Algorithm for Vector Optimization
- A conjugate gradient method with descent direction for unconstrained optimization
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- A modified Quasi-Newton method for vector optimization problem
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- A projected gradient method for vector optimization problems
- A scaled three-term conjugate gradient method for unconstrained optimization
- A steepest descent method for vector optimization
- A study of Liu-Storey conjugate gradient methods for vector optimization
- A subgradient method for vector optimization problems
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Approximate proximal methods in vector optimization
- Benchmarking optimization software with performance profiles.
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- Convergence properties of the Fletcher-Reeves method
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Generalized homotopy approach to multiobjective optimization.
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Inexact projected gradient method for vector optimization
- Methods of conjugate gradients for solving linear systems
- Multicriteria approach to bilevel optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Newton's method for multiobjective optimization
- Newton-like methods for efficient solutions in vector optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- On the convergence of the projected gradient method for vector optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Optimization of rod antennas of mobile phones
- Practical augmented Lagrangian methods for constrained optimization
- Proximal Methods in Vector Optimization
- Quasi-Newton methods for solving multiobjective optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis
- Steepest descent methods for critical points in vector optimization problems
- Steepest descent methods for multicriteria optimization.
- Testing Unconstrained Optimization Software
- The convergence properties of some new conjugate gradient methods
Cited in
(4)- On the extension of a hybrid conjugate gradient algorithm for multiobjective optimization
- A new hybrid conjugate gradient method based on a convex combination for multiobjective optimization
- New hybrid conjugate gradient algorithm for vector optimization problems
- On the Dai–Liao conjugate gradient method for vector optimization
This page was built for publication: Efficient nonlinear conjugate gradient techniques for vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964415)
