Characterizations of multiobjective robustness via oriented distance function and image space analysis

DOI10.1007/s10957-019-01505-yzbMath1416.49017OpenAlexW2921182857MaRDI QIDQ2420816

Pradeep Sharma, Qamrul Hasan Ansari, Elisabeth Köbis

Publication date: 7 June 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-019-01505-y

zbMATH Keywords

robustnessimage space analysisset relationsoriented distance functionuncertain multiobjective optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53)

Related Items (22)

Some properties of generalized oriented distance function and their applications to set optimization problems ⋮ Image space analysis for set optimization problems with applications ⋮ Necessary optimality conditions for nonsmooth robust optimization problems ⋮ Path connectedness of the efficient solution set for generalized vector quasi-equilibrium problems ⋮ On scalarization and well-posedness in set optimization with a partial set order relation ⋮ Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization ⋮ Robust duality for nonconvex uncertain vector optimization via a general scalarization ⋮ Characterizations of multi-objective robustness solutions defined by Minkowski set difference ⋮ Optimality and error bound for set optimization with application to uncertain multi-objective programming ⋮ Robustness characterizations for uncertain optimization problems via image space analysis ⋮ Conditional gradient method for vector optimization ⋮ Connectedness of the solution sets in generalized semi-infinite set optimization ⋮ Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints ⋮ Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis ⋮ Characterizations of robust optimality conditions via image space analysis ⋮ Scalarization of multiobjective robust optimization problems ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Dynamic analysis of fractional-order quaternion-valued fuzzy memristive neural networks: vector ordering approach ⋮ A unified approach through image space analysis to robustness in uncertain optimization problems ⋮ Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach ⋮ Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency ⋮ Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minmax robustness for multi-objective optimization problems
• Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
• Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
• Vector variational-like inequalities with constraints: separation and alternative
• New order relations in set optimization
• Merit functions in vector optimization
• Semidifferentiable functions and necessary optimality conditions
• Shape analysis via oriented distance functions
• Image space analysis for constrained inverse vector variational inequalities via multiobjective optimization
• Decision uncertainty in multiobjective optimization
• A unified characterization of multiobjective robustness via separation
• Theorems of the alternative and optimality conditions
• Level set methods and dynamic implicit surfaces
• Nonlinear separation approach to constrained extremum problems
• The relationship between multi-objective robustness concepts and set-valued optimization
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Degrees of Efficiency and Degrees of Minimality
• Characterizations of set relations with respect to variable domination structures via oriented distance function
• Vector Variational Inequalities and Vector Optimization
• Characterizations of set order relations and constrained set optimization problems via oriented distance function
• Oriented Distance Function and Its Evolution Equation for Initial Sets with Thin Boundary
• A fast sweeping method for Eikonal equations
• Multicriteria Optimization
• Set-valued Optimization
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

This page was built for publication: Characterizations of multiobjective robustness via oriented distance function and image space analysis