Nonlinear Conjugate Gradient Methods for Vector Optimization
From MaRDI portal
Recommendations
- Publication:3125512
- Nonlinear conjugate gradient methods for unconstrained optimization
- Publication:4312995
- Conjugate gradient algorithms in nonconvex optimization
- On nonlinear generalized conjugate gradient methods
- Publication:3313210
- Nonlinear conjugate gradient methods.
- Scientific article; zbMATH DE number 1822238
- Vector optimization for a class of nonconvex functions
- A nonlinear conjugate gradient method for a special class of matrix optimization problems
Cites work
- scientific article; zbMATH DE number 1004164 (Why is no real title available?)
- 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 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- 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 bicriterial optimization problem of antenna design
- A modified Quasi-Newton method for vector optimization problem
- A projected gradient method for vector optimization problems
- 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 subgradient method for vector optimization problems
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- A survey of nonlinear conjugate gradient methods
- An interior proximal method in vector optimization
- Approximate proximal methods in vector optimization
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence analysis of nonlinear conjugate gradient methods
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Evolutionary Multi-Criterion Optimization
- Function minimization by conjugate gradients
- Generalized homotopy approach to multiobjective optimization.
- Generalized proximal method for efficient solutions in vector optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Hybrid approximate proximal algorithms for efficient solutions in vector optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Inexact projected gradient method for vector optimization
- Line search algorithms with guaranteed sufficient decrease
- Methods of conjugate gradients for solving linear systems
- Multicriteria approach to bilevel optimization
- Newton's method for multiobjective optimization
- Newton-like methods for efficient solutions in vector optimization
- Newton-like methods for solving vector optimization problems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- On the convergence of the projected gradient method for vector optimization
- On the location of antennas for treatment planning in hyperthermia
- 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.
- The conjugate gradient method in extremal problems
Cited in
(87)- On high-order model regularization for multiobjective optimization
- On the extension of a hybrid conjugate gradient algorithm for multiobjective optimization
- Nonlinear conjugate gradient method for vector optimization on Riemannian manifolds with retraction and vector transport
- On the convergence of Newton-type proximal gradient method for multiobjective optimization problems
- Complexity of gradient descent for multiobjective optimization
- A new hybrid conjugate gradient method based on a convex combination for multiobjective optimization
- scientific article; zbMATH DE number 1157672 (Why is no real title available?)
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- Conditional gradient method for vector optimization
- Efficient nonlinear conjugate gradient techniques for vector optimization problems
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- The Dai–Liao-type conjugate gradient methods for solving vector optimization problems
- A proximal gradient splitting method for solving convex vector optimization problems
- A generalized conditional gradient method for multiobjective composite optimization problems
- An inexact proximal point method for quasiconvex multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- An explicit three-term Polak-Ribière-Polyak conjugate gradient method for bicriteria optimization
- Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization
- New hybrid conjugate gradient algorithm for vector optimization problems
- Multiobjective BFGS method for optimization on Riemannian manifolds
- On the convergence analysis of a proximal gradient method for multiobjective optimization
- An explicit spectral Fletcher-Reeves conjugate gradient method for bi-criteria optimization
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Accelerated nonmonotone line search technique for multiobjective optimization
- A vector restricted variant MVHS+ CG method based algorithm for unconstrained vector optimization problems
- An accelerated proximal gradient method for multiobjective optimization
- The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
- A quadratically convergent Newton method for vector optimization
- A Barzilai-Borwein descent method for multiobjective optimization problems
- A study of Liu-Storey conjugate gradient methods for vector optimization
- Conditional gradient method for multiobjective optimization
- Modeling Hessian-vector products in nonlinear optimization: new Hessian-free methods
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Nonlinear conjugate gradient methods for unconstrained optimization
- Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
- Nonmonotone Wolfe-type quasi-Newton methods for multiobjective optimization problems
- Spectral conjugate gradient methods for vector optimization problems
- Effective front-descent algorithms with convergence guarantees
- Two modified hybrid conjugate gradient methods for nonconvex vector optimization
- A novel hybrid conjugate gradient method for multiobjective optimization problems
- A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
- On the convergence of conditional gradient method for unbounded multiobjective optimization problems
- scientific article; zbMATH DE number 6263489 (Why is no real title available?)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- A diagonal quasi-Newton method with modified BFGS update for nonconvex multiobjective optimization
- A strongly convergent proximal point method for vector optimization
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
- A novel class of spectral conjugate gradient methods for unconstrained multiobjective optimization with practical application in image processing
- Improvements to steepest descent method for multi-objective optimization
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- A concave optimization-based approach for sparse multiobjective programming
- A steepest descent method for vector optimization
- A hybrid gradient method for vector optimization problems
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A trust region method for solving multicriteria optimization problems on Riemannian manifolds
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- A weighted hybrid conjugate gradient method for unconstrained multiobjective optimization problems.
- On the Dai–Liao conjugate gradient method for vector optimization
- Uniform weak sharp minima for multiobjective optimization problems
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- A proximal gradient method with an explicit line search for multiobjective optimization
- Convergence rates analysis of a multiobjective proximal gradient method
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- A modified Polak-Ribière-Polyak type conjugate gradient method for vector optimization
- Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- Globally convergent Newton-type methods for multiobjective optimization
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Variable metric method for unconstrained multiobjective optimization problems
- Generalized conditional gradient methods for multiobjective composite optimization problems with Hölder condition
- Preconditioned Barzilai-Borwein methods for multiobjective optimization problems
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Memory gradient method for multiobjective optimization
- A limited memory quasi-Newton approach for multi-objective optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- MOEA/D with gradient-enhanced kriging for expensive multiobjective optimization
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- Cubic regularization technique of the Newton method for vector optimization
- A conjugate directions-type procedure for quadratic multiobjective optimization
- A subspace minimization Barzilai-Borwein method for multiobjective optimization problems
- Nonlinear conjugate gradient methods for optimization of set-valued maps of finite cardinality
This page was built for publication: Nonlinear Conjugate Gradient Methods for Vector Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4687237)
