An adaptive combined conjugate gradient method for multiobjective optimization problems beyond convexity
In this manuscript, the authors studied multiobjective optimization problems by presening a new adaptive combined conjugate gradient method whose search direction is determined only by the gradient information of the functions involved and the conjugate term. They obtained the global convergence of their method under some mild assumptions. They also provided some numerical experiments to support the effectiveness and superiority of their solution method. In addition, their method is also effective for high-dimensional multiobjective optimization problems.
- A Barzilai-Borwein conjugate gradient method
- A derivative-free trust-region method for biobjective optimization
- A method for constrained multiobjective optimization based on SQP techniques
- A modified Quasi-Newton method for vector optimization problem
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new scalarization technique and new algorithms to generate Pareto fronts
- A Newton-like method for variable order vector optimization problems
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A projected gradient method for vector optimization problems
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- A quadratically convergent Newton method for vector optimization
- A soft multi-criteria decision analysis model with application to the European Union enlargement
- 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
- Adaptive Scalarization Methods in Multiobjective Optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- An overview of nonlinear optimization
- Combined gradient methods for multiobjective optimization
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- Convexificators for nonconvex multiobjective optimization problems with uncertain data: robust optimality and duality
- Direct Multisearch for Multiobjective Optimization
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- Function minimization by conjugate gradients
- Generalized homotopy approach to multiobjective optimization.
- Generalized proximal point algorithms for multiobjective optimization problems
- scientific article; zbMATH DE number 47208 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- Multi-objective machine learning
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
- Newton's method for multiobjective optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- 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
- Proximal Methods in Vector Optimization
- Quasi-Newton methods for solving multiobjective optimization
- Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis
- Steepest descent methods for multicriteria optimization.
- The conjugate gradient method in extremal problems
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- Vector optimization. Theory, applications, and extensions
- Vector variational inequalities and vector optimization. Theory and applications
This page was built for publication: An adaptive combined conjugate gradient method for multiobjective optimization problems beyond convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443455)