Pages that link to "Item:Q1836592"

The following pages link to Scalarizing vector optimization problems (Q1836592):

Displaying 50 items.

• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization (Q2147143) (← links)
• A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
• Necessary conditions for nondominated solutions in vector optimization (Q2198529) (← links)
• Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior (Q2260684) (← links)
• Minimum type functions, plus-cogauges, and applications (Q2260689) (← links)
• Comparison of some scalarization methods in multiobjective optimization (Q2272601) (← links)
• Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem (Q2274876) (← links)
• Scalarization functionals with uniform level sets in set optimization (Q2315266) (← links)
• A derivative-free descent method in set optimization (Q2340524) (← links)
• The adaptive parameter control method and linear vector optimization (Q2351187) (← links)
• Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems (Q2356347) (← links)
• Optimality conditions for a unified vector optimization problem with not necessarily preordering relations (Q2392756) (← links)
• Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming (Q2410884) (← links)
• An iterative method for solving a bi-objective constrained portfolio optimization problem (Q2419517) (← links)
• Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems (Q2423811) (← links)
• Equispaced Pareto front construction for constrained bi-objective optimization (Q2450442) (← links)
• On the choice of parameters for the weighting method in vector optimization (Q2467161) (← links)
• An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• A limited memory quasi-Newton approach for multi-objective optimization (Q2701416) (← 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)
• A deterministic algorithm for global multi-objective optimization (Q2926067) (← links)
• Characterizing ϵ-properly efficient solutions (Q2943836) (← links)
• Equilibrium in a vector supply–demand network with capacity constraints (Q3006694) (← links)
• A unified vector optimization problem: complete scalarizations and applications (Q3111143) (← links)
• Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini (Q3177624) (← links)
• A Constraint Method in Nonlinear Multi-Objective Optimization (Q3649585) (← links)
• Introducing Nonpolyhedral Cones to Multiobjective Programming (Q3649588) (← links)
• Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming (Q3724107) (← links)
• Selection of efficient points (Q3743138) (← links)
• (Q4039214) (← links)
• Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone (Q4571750) (← links)
• A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization (Q4634096) (← links)
• Approximation of the efficient point set by perturbation of the ordering cone (Q4713649) (← links)
• Regularized nonlinear scalarization for vector optimization problems with PDE-constraints (Q4900447) (← links)
• Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization (Q4999342) (← links)
• A modified direction approach for proper efficiency of multiobjective optimization (Q4999343) (← links)
• Methods for Multiobjective Bilevel Optimization (Q5014637) (← links)
• On high-order model regularization for multiobjective optimization (Q5038176) (← links)
• A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem (Q5052583) (← links)
• A penalty decomposition approach for multi-objective cardinality-constrained optimization problems (Q5058409) (← links)
• Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems (Q5058972) (← links)
• Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)
• Strong and weak conditions of regularity and optimality (Q5095720) (← links)
• An Image Set-Oriented Method for the Numerical Treatment of Bi-Level Multi-objective Optimization Problems (Q5131687) (← links)
• Scalarization in vector optimization with arbitrary domination sets (Q5131825) (← links)
• Nonlinear scalarizing functions in set optimization problems (Q5239080) (← links)
• A New Scalarization Technique and New Algorithms to Generate Pareto Fronts (Q5266532) (← links)