Nonlinear Conjugate Gradient Methods for Vector Optimization
From MaRDI portal
Publication:4687237
DOI10.1137/17M1126588zbMath1401.90210OpenAlexW2893010165MaRDI QIDQ4687237
L. R. Lucambio Pérez, L. F. Prudente
Publication date: 11 October 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1126588
unconstrained optimizationvector optimizationconjugate gradient methodPareto-optimalityWolfe conditionsline search algorithm
Related Items (30)
A proximal gradient splitting method for solving convex vector optimization problems ⋮ On high-order model regularization for multiobjective optimization ⋮ A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ A conjugate directions-type procedure for quadratic multiobjective optimization ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ A concave optimization-based approach for sparse multiobjective programming ⋮ Variable metric method for unconstrained multiobjective optimization problems ⋮ Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem ⋮ An accelerated proximal gradient method for multiobjective optimization ⋮ Spectral conjugate gradient methods for vector optimization problems ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ Convergence rates of the stochastic alternating algorithm for bi-objective optimization ⋮ Conditional gradient method for vector optimization ⋮ Multiobjective BFGS method for optimization on Riemannian manifolds ⋮ An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems ⋮ Multiobjective conjugate gradient methods on Riemannian manifolds ⋮ A Barzilai-Borwein descent method for multiobjective optimization problems ⋮ Convergence rates analysis of a multiobjective proximal gradient method ⋮ MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS ⋮ Memory gradient method for multiobjective optimization ⋮ A limited memory quasi-Newton approach for multi-objective optimization ⋮ Conditional gradient method for multiobjective optimization ⋮ Complexity of gradient descent for multiobjective optimization ⋮ A strongly convergent proximal point method for vector optimization ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds ⋮ Globally convergent Newton-type methods for multiobjective optimization ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-Newton methods for solving multiobjective optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- An interior proximal method in vector optimization
- Multicriteria approach to bilevel optimization
- Epsilon-dominating solutions in mean-variance portfolio analysis
- A bicriterial optimization problem of antenna design
- On the location of antennas for treatment planning in hyperthermia
- Steepest descent methods for multicriteria optimization.
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- Optimization of rod antennas of mobile phones
- Approximate proximal methods in vector optimization
- Inexact projected gradient method for vector optimization
- Newton-like methods for efficient solutions in vector optimization
- A soft multi-criteria decision analysis model with application to the European Union enlargement
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Robust multiobjective optimization \& applications in portfolio optimization
- Newton-like methods for solving vector optimization problems
- Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
- On the convergence of the projected gradient method for vector optimization
- Steepest descent methods for critical points in vector optimization problems
- Generalized Proximal Method for Efficient Solutions in Vector Optimization
- A modified Quasi-Newton method for vector optimization problem
- Newton's Method for Multiobjective Optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Line search algorithms with guaranteed sufficient decrease
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A quadratically convergent Newton method for vector optimization
- Proximal Methods in Vector Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- A Subgradient Method for Vector Optimization Problems
- Practical Augmented Lagrangian Methods for Constrained Optimization
- The conjugate gradient method in extremal problems
- Evolutionary Multi-Criterion Optimization
- Methods of conjugate gradients for solving linear systems
- Generalized homotopy approach to multiobjective optimization.
This page was built for publication: Nonlinear Conjugate Gradient Methods for Vector Optimization
