Pages that link to "Item:Q635150"

The following pages link to An interior proximal method in vector optimization (Q635150):

Displaying 26 items.

• Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions (Q289089) (← links)
• A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application (Q319989) (← links)
• Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management (Q481062) (← links)
• A proximal point algorithm with quasi-distance in multi-objective optimization (Q504811) (← links)
• Logarithmic quasi-distance proximal point scalarization method for multi-objective programming (Q668555) (← links)
• A proximal point-type method for multicriteria optimization (Q741360) (← links)
• A scalarization proximal point method for quasiconvex multiobjective minimization (Q905757) (← links)
• An inexact proximal method with proximal distances for quasimonotone equilibrium problems (Q1689071) (← links)
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
• On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds (Q1697905) (← links)
• Proximal point method for a special class of nonconvex multiobjective optimization functions (Q1744628) (← links)
• A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← links)
• Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
• A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
• On the extension of the Hager-Zhang conjugate gradient method for vector optimization (Q2191796) (← links)
• Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds (Q2198534) (← links)
• The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← links)
• A linear scalarization proximal point method for quasiconvex multiobjective minimization (Q2278894) (← links)
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
• Proximal point method for vector optimization on Hadamard manifolds (Q2417040) (← links)
• Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm (Q2675732) (← links)
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization (Q2675734) (← links)
• Inertial forward–backward methods for solving vector optimization problems (Q3177614) (← links)
• An inexact algorithm with proximal distances for variational inequalities (Q4579889) (← links)
• Conditional gradient method for vector optimization (Q6133299) (← links)
• Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds (Q6140944) (← links)