An explicit three-term Polak-Ribière-Polyak conjugate gradient method for bicriteria optimization

DOI10.1016/J.ORL.2024.107195MaRDI QIDQ6988270zbMATH OpenFDO

Authors Youssef Elboulqe, Mounir El Maghri

Publication date 5 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107195

zbMATH Keywords

descent directionsline searchmulticriteria optimizationPareto critical pointPareto optimalityPRP conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Methods of quasi-Newton type (90C53)

Cites work

• A conjugate directions-type procedure for quadratic multiobjective optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• A modified Quasi-Newton method for vector optimization problem
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A reduced Jacobian method with full convergence property
• A study of Liu-Storey conjugate gradient methods for vector optimization
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
• Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
• Algorithms for multicriterion optimization
• Benchmarking optimization software with performance profiles.
• Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
• Explicit gradient information in multiobjective optimization
• Function minimization by conjugate gradients
• Generalized homotopy approach to multiobjective optimization.
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• Newton's method for multiobjective optimization
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• Nonmonotone line searches for unconstrained multiobjective optimization problems
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• On the extension of the Hager-Zhang conjugate gradient method for vector optimization
• Quasi-Newton methods for solving multiobjective optimization
• Reduced Jacobian method
• Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis
• Some descent three-term conjugate gradient methods and their global convergence
• Steepest descent methods for multicriteria optimization.
• Testing Unconstrained Optimization Software
• The conjugate gradient method in extremal problems
• The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous

This page was built for publication: An explicit three-term Polak-Ribière-Polyak conjugate gradient method for bicriteria optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988270)