Pages that link to "Item:Q3328302"

The following pages link to Scalarization in vector optimization (Q3328302):

Displaying 50 items.

• A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application (Q319989) (← links)
• Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions (Q369642) (← links)
• The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems (Q440840) (← 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)
• Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
• Nonconvex separation theorems and some applications in vector optimization (Q584070) (← links)
• A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions (Q646046) (← links)
• Convex composite multi-objective nonsmooth programming (Q687035) (← links)
• On the convergence of steepest descent methods for multiobjective optimization (Q782907) (← links)
• A duality theory for set-valued functions. I: Fenchel conjugation theory (Q833019) (← links)
• Two types of minimax theorems for vector-valued functions (Q911473) (← links)
• Solution concepts in continuous-kernel multicriteria games (Q915662) (← links)
• Partially ordered cooperative games: Extended core and Shapley value (Q926365) (← links)
• Stability achievement scalarization function for multiobjective nonlinear programming problems (Q949920) (← links)
• Merit functions in vector optimization (Q1013975) (← links)
• Scalarization approaches for set-valued vector optimization problems and vector variational inequalities (Q1025036) (← links)
• Existence theorems in vector optimization (Q1065719) (← links)
• General communication schemes for multiobjective decision making (Q1075941) (← links)
• A survey of vector optimization in infinite-dimensional spaces. II (Q1075946) (← links)
• On the completeness and constructiveness of parametric characterizations to vector optimization problems (Q1075949) (← links)
• Parametric approximation problems arising in vector optimization (Q1078092) (← links)
• Scalarization of vector optimization problems (Q1091277) (← links)
• Characterizing the nondominated set by separable functions (Q1093551) (← links)
• A modified weighted Tchebycheff metric for multiple objective programming (Q1096546) (← links)
• Upper robust mappings and vector minimization: An integral approach (Q1268142) (← links)
• Bases of convex cones and Borwein's proper efficiency (Q1321132) (← links)
• Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions (Q1331095) (← links)
• Cones admitting strictly positive functionals and scalarization of some vector optimization problems (Q1379957) (← links)
• Scalarization of Henig proper efficient points in a normed space (Q1579643) (← links)
• Images, fixed points and vector extremum problems (Q1670138) (← links)
• Notes on Lipschitz properties of nonlinear scalarization functions with applications (Q1724982) (← links)
• Vector exponential penalty function method for nondifferentiable multiobjective programming problems (Q1746707) (← links)
• On the convergence of multiobjective evolutionary algorithms (Q1806943) (← links)
• Continuous dependence of solutions on a parameter in a scalarization method (Q1821700) (← links)
• Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces (Q1937018) (← links)
• Explicit solution for a vector-valued LQG homing problem (Q1941203) (← links)
• Asymptotic analysis in convex composite multiobjective optimization problems (Q1945516) (← links)
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
• A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems (Q2033709) (← links)
• On \(q\)-Newton's method for unconstrained multiobjective optimization problems (Q2053032) (← links)
• On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
• A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
• Nonconvex composite multiobjective nonsmooth fractional programming (Q2250365) (← links)
• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
• Inexact projected gradient method for vector optimization (Q2377166) (← links)
• A conic scalarization method in multi-objective optimization (Q2392759) (← links)
• A general approach for studying duality in multiobjective optimization (Q2460035) (← links)
• On the choice of parameters for the weighting method in vector optimization (Q2467161) (← links)
• On some properties and an application of the logarithmic barrier method (Q2467165) (← links)