Pages that link to "Item:Q2377166"
From MaRDI portal
The following pages link to Inexact projected gradient method for vector optimization (Q2377166):
Displaying 47 items.
- An external penalty-type method for multicriteria (Q301402) (← links)
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906) (← links)
- A proximal point-type method for multicriteria optimization (Q741360) (← links)
- An augmented Lagrangian algorithm for multi-objective optimization (Q782908) (← links)
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
- A weighting subgradient algorithm for multiobjective optimization (Q1744637) (← links)
- A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← links)
- Conditional gradient method for multiobjective optimization (Q2028470) (← links)
- A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
- Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications (Q2122022) (← links)
- On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
- A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
- A quasi-Newton method with Wolfe line searches for multiobjective optimization (Q2159465) (← links)
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization (Q2191796) (← links)
- The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← links)
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds (Q2302754) (← links)
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
- Proximal point method for vector optimization on Hadamard manifolds (Q2417040) (← links)
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous (Q2417182) (← links)
- Newton-like methods for solving vector optimization problems (Q2875559) (← links)
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
- Nonlinear Conjugate Gradient Methods for Vector Optimization (Q4687237) (← links)
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems (Q5058409) (← links)
- A barrier-type method for multiobjective optimization (Q5151514) (← links)
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem (Q6050365) (← links)
- An accelerated proximal gradient method for multiobjective optimization (Q6051298) (← links)
- Spectral conjugate gradient methods for vector optimization problems (Q6051300) (← links)
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization (Q6108978) (← links)
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints (Q6108979) (← links)
- Conditional gradient method for vector optimization (Q6133299) (← links)
- Multiobjective BFGS method for optimization on Riemannian manifolds (Q6155056) (← links)
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems (Q6164611) (← links)
- Multiobjective conjugate gradient methods on Riemannian manifolds (Q6167092) (← links)
- A memetic procedure for global multi-objective optimization (Q6175704) (← links)
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization (Q6498413) (← links)
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms (Q6536388) (← links)
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization (Q6561493) (← links)
- A nonmonotone projected gradient method for multiobjective problems on convex sets (Q6566784) (← links)
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems (Q6568922) (← links)
- Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds (Q6611215) (← links)
- On the extension of Dai-Liao conjugate gradient method for vector optimization (Q6636812) (← links)
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization (Q6642790) (← links)
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization (Q6642792) (← links)
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints (Q6659765) (← links)
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization (Q6661704) (← links)