Pages that link to "Item:Q1765484"
From MaRDI portal
The following pages link to A steepest descent method for vector optimization (Q1765484):
Displaying 50 items.
- An external penalty-type method for multicriteria (Q301402) (← links)
- Quadratic scalarization for decomposed multiobjective optimization (Q331788) (← links)
- Multi agent collaborative search based on Tchebycheff decomposition (Q360379) (← 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 dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions (Q458364) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- Bi-objective hypervolume-based Pareto optimization (Q497433) (← 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)
- An interior proximal method in vector optimization (Q635150) (← links)
- A proximal point-type method for multicriteria optimization (Q741360) (← links)
- On the convergence of steepest descent methods for multiobjective optimization (Q782907) (← links)
- An existence result for the generalized vector equilibrium problem on Hadamard manifolds (Q896188) (← links)
- Tikhonov-type regularization method for efficient solutions in vector optimization (Q966089) (← links)
- A \(p\)-adaptive scaled boundary finite element method based on maximization of the error decrease rate (Q1021094) (← links)
- Multiple reduced gradient method for multiobjective optimization problems (Q1625772) (← links)
- A cutting-plane method to nonsmooth multiobjective optimization problems (Q1719612) (← links)
- Quasi-Newton methods for multiobjective optimization problems (Q1728407) (← links)
- A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← 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)
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization (Q2026727) (← links)
- Conditional gradient method for multiobjective optimization (Q2028470) (← links)
- A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems (Q2053032) (← links)
- Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
- Combined gradient methods for multiobjective optimization (Q2089219) (← links)
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems (Q2132125) (← links)
- On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
- Expensive multi-objective optimization of electromagnetic mixing in a liquid metal (Q2139155) (← 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 steepest descent method for set optimization problems with set-valued mappings of finite cardinality (Q2231334) (← links)
- Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces (Q2247897) (← links)
- Quasi-Newton's method for multiobjective optimization (Q2252751) (← links)
- The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← 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)
- A unified characterization of nonlinear scalarizing functionals in optimization (Q2330979) (← 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)
- Proximal point method for vector optimization on Hadamard manifolds (Q2417040) (← links)
- On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds (Q2474954) (← links)