Pages that link to "Item:Q2467161"

The following pages link to On the choice of parameters for the weighting method in vector optimization (Q2467161):

Displaying 34 items.

• 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 subgradient-like algorithm for solving vector convex inequalities (Q467438) (← links)
• Existence and boundedness of solutions in infinite-dimensional vector optimization problems (Q467450) (← links)
• Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
• An interior proximal method in vector optimization (Q635150) (← links)
• On the convergence of steepest descent methods for multiobjective optimization (Q782907) (← links)
• Tikhonov-type regularization method for efficient solutions in vector optimization (Q966089) (← links)
• A weighting subgradient algorithm for multiobjective optimization (Q1744637) (← links)
• Accelerated diagonal steepest descent method for unconstrained multiobjective optimization (Q2026727) (← links)
• On \(q\)-Newton's method for unconstrained multiobjective optimization problems (Q2053032) (← links)
• Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← links)
• On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
• Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior (Q2260684) (← links)
• Inexact projected gradient method for vector optimization (Q2377166) (← links)
• Newton-like methods for efficient solutions in vector optimization (Q2377172) (← links)
• On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
• A unified vector optimization problem: complete scalarizations and applications (Q3111143) (← links)
• On the convergence of the projected gradient method for vector optimization (Q3112500) (← links)
• Steepest descent methods for critical points in vector optimization problems (Q3143359) (← links)
• Inertial forward–backward methods for solving vector optimization problems (Q3177614) (← links)
• Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization (Q3383208) (← links)
• A modified Quasi-Newton method for vector optimization problem (Q3453403) (← links)
• The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem (Q4637508) (← links)
• A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
• A nonmonotone gradient method for constrained multiobjective optimization problems (Q5052584) (← links)
• A penalty decomposition approach for multi-objective cardinality-constrained optimization problems (Q5058409) (← links)
• Improved front steepest descent for multi-objective optimization (Q6106527) (← links)
• Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints (Q6108979) (← links)
• Pareto front approximation through a multi-objective augmented Lagrangian method (Q6114906) (← links)
• A memetic procedure for global multi-objective optimization (Q6175704) (← links)
• An inexact nonmonotone projected gradient method for constrained multiobjective optimization (Q6561493) (← links)
• Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach (Q6561498) (← links)
• A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization (Q6664932) (← links)