Pages that link to "Item:Q1876582"
From MaRDI portal
The following pages link to A projected gradient method for vector optimization problems (Q1876582):
Displaying 50 items.
- An external penalty-type method for multicriteria (Q301402) (← links)
- Robustness in nonsmooth nonlinear multi-objective programming (Q319993) (← links)
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906) (← links)
- A subgradient method for multiobjective optimization on Riemannian manifolds (Q382921) (← links)
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces (Q456993) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- A proximal point algorithm with quasi-distance in multi-objective optimization (Q504811) (← links)
- An algorithm for vector optimization problems (Q523236) (← links)
- Generalized viscosity approximation methods in multiobjective optimization problems (Q540628) (← links)
- Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261) (← 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)
- Tikhonov-type regularization method for efficient solutions in vector optimization (Q966089) (← links)
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces (Q971618) (← links)
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems (Q1021502) (← links)
- Reduced Jacobian method (Q1626533) (← links)
- Informative input design for kernel-based system identification (Q1640228) (← links)
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
- Quasi-Newton methods for multiobjective optimization problems (Q1728407) (← links)
- A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← links)
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems (Q1756580) (← links)
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds (Q1762393) (← links)
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems (Q1991255) (← links)
- Conditional gradient method for multiobjective optimization (Q2028470) (← links)
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems (Q2046554) (← links)
- A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
- A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
- Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
- Combined gradient methods for multiobjective optimization (Q2089219) (← 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)
- Quasi-Newton's method for multiobjective optimization (Q2252751) (← 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)
- Approximate proximal methods in vector optimization (Q2370322) (← links)
- A subgradient method for multiobjective optimization (Q2377160) (← links)
- Inexact projected gradient method for vector optimization (Q2377166) (← links)
- Newton-like methods for efficient solutions in vector optimization (Q2377172) (← links)
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous (Q2417182) (← links)
- Proximal gradient methods for multiobjective optimization and their applications (Q2419509) (← links)
- On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812) (← links)
- Barzilai and Borwein's method for multiobjective optimization problems (Q2630749) (← links)