Pages that link to "Item:Q3328302"

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

Displaying 38 items.

• 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)
• Existence of solutions for a generalized vector quasivariational inequality (Q2565016) (← links)
• Relationship between solid cones and cones with bases (Q2565023) (← links)
• Use of exact penalty functions to determine efficient decisions (Q2638947) (← links)
• On Efficient Solutions with Trade-Offs Bounded by Given Values (Q2795098) (← links)
• A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals (Q2841149) (← links)
• The Exactness Property of the Vector Exact <i>l</i>₁ Penalty Function Method in Nondifferentiable Invex Multiobjective Programming (Q2964199) (← links)
• Duality for vector optimization problems via a general scalarization (Q3111136) (← 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)
• On two-coefficient identification in elliptic variational inequalities (Q3177617) (← links)
• Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini (Q3177624) (← links)
• On the characterization of efficient points by means of monotone functionals (Q3809595) (← links)
• Scalarization in vector optimization by cone perturbation (Q3976782) (← links)
• A generalized section theorem and a minimax inequality for a vector-valued mapping¹ (Q3979524) (← links)
• (Q4028864) (← links)
• (Q4039214) (← links)
• Super Efficiency in Vector Optimization (Q4201528) (← links)
• Necessary conditions for extremality and separation theorems with applications to multiobjective optimization (Q4256095) (← links)
• OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION (Q4548046) (← links)
• Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone (Q4571750) (← links)
• Robustness to uncertain optimization using scalarization techniques and relations to multiobjective optimization (Q4628919) (← links)
• The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem (Q4637508) (← links)
• Super efficiency in convex vector optimization (Q4713648) (← links)
• (Q4721876) (← links)
• Time-varying multi-objective optimisation over switching graphs via fixed-time consensus algorithms (Q5026573) (← links)
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
• A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
• A barrier-type method for multiobjective optimization (Q5151514) (← links)
• Efficient solutions in generalized linear vector optimization (Q5379436) (← links)
• A vectorization for nonconvex set-valued optimization (Q5742726) (← links)
• Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints (Q6108979) (← links)
• MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS (Q6196941) (← links)
• Convergence analysis of a norm minimization-based convex vector optimization algorithm (Q6587338) (← links)
• A PRP type conjugate gradient method without truncation for nonconvex vector optimization (Q6661704) (← links)