Pages that link to "Item:Q3112500"
From MaRDI portal
The following pages link to On the convergence of the projected gradient method for vector optimization (Q3112500):
Displaying 45 items.
- An external penalty-type method for multicriteria (Q301402) (← links)
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- A proximal point-type method for multicriteria optimization (Q741360) (← links)
- An augmented Lagrangian algorithm for multi-objective optimization (Q782908) (← links)
- Charnes-Cooper scalarization and convex vector optimization (Q828709) (← links)
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
- Conditional gradient method for multiobjective optimization (Q2028470) (← links)
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems (Q2046554) (← links)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← 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)
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← 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)
- Inexact projected gradient method for vector optimization (Q2377166) (← 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)
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem (Q4637508) (← links)
- Nonlinear Conjugate Gradient Methods for Vector Optimization (Q4687237) (← links)
- On high-order model regularization for multiobjective optimization (Q5038176) (← links)
- A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems (Q5058409) (← links)
- Convergence analysis of a projected gradient method for multiobjective optimization problems (Q5090002) (← links)
- A barrier-type method for multiobjective optimization (Q5151514) (← links)
- A quadratically convergent Newton method for vector optimization (Q5169449) (← links)
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints (Q6108979) (← links)
- Multiobjective BFGS method for optimization on Riemannian manifolds (Q6155056) (← links)
- Multiobjective conjugate gradient methods on Riemannian manifolds (Q6167092) (← links)
- A memetic procedure for global multi-objective optimization (Q6175704) (← links)
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS (Q6196941) (← links)
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms (Q6536388) (← links)
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem (Q6541378) (← links)
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization (Q6561493) (← links)
- A line search technique for a class of multi-objective optimization problems using subgradient (Q6564720) (← 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)
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization (Q6568923) (← links)
- Accelerated nonmonotone line search technique for multiobjective optimization (Q6593954) (← 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)
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints (Q6659765) (← links)