Characterizations of multiobjective robustness via oriented distance function and image space analysis
From MaRDI portal
Recommendations
- A unified characterization of multiobjective robustness via separation
- Characterizations of multiobjective robustness on vectorization counterparts
- Scalarization of multiobjective robust optimization problems
- Characterizations of robust optimality conditions via image space analysis
- Robustness characterizations for uncertain optimization problems via image space analysis
Cites work
- scientific article; zbMATH DE number 3761793 (Why is no real title available?)
- A fast sweeping method for Eikonal equations
- A unified characterization of multiobjective robustness via separation
- Characterizations of set order relations and constrained set optimization problems via oriented distance function
- Characterizations of set relations with respect to variable domination structures via oriented distance function
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Decision uncertainty in multiobjective optimization
- Degrees of Efficiency and Degrees of Minimality
- Image space analysis for constrained inverse vector variational inequalities via multiobjective optimization
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
- Level set methods and dynamic implicit surfaces
- Merit functions in vector optimization
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- New order relations in set optimization
- Nonlinear separation approach to constrained extremum problems
- Oriented Distance Function and Its Evolution Equation for Initial Sets with Thin Boundary
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Semidifferentiable functions and necessary optimality conditions
- Set-valued optimization. An introduction with applications
- Shape analysis via oriented distance functions
- Shapes and geometries. Analysis, differential calculus, and optimization
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The relationship between multi-objective robustness concepts and set-valued optimization
- Theorems of the alternative and optimality conditions
- Vector variational inequalities and vector optimization. Theory and applications
- Vector variational-like inequalities with constraints: separation and alternative
Cited in
(40)- Characterizations of robust optimality conditions via image space analysis
- Robustness characterizations for uncertain optimization problems via image space analysis
- Existence and arcwise connectedness of robust solutions for uncertain generalized multi-objective optimization problems
- Characterizations of multiobjective robustness on vectorization counterparts
- A unified approach through image space analysis to robustness in uncertain optimization problems
- Conditional gradient method for vector optimization
- Optimality conditions in uncertain multi-objective optimization problems with a variable domination structure
- Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
- Nonlinear scalarization in set optimization based on the concept of null set
- Lagrange stability of quaternion-valued memristive neural networks
- Optimality conditions of robust convex multiobjective optimization via -constraint scalarization and image space analysis
- Connectedness of the solution sets in generalized semi-infinite set optimization
- Some properties of generalized oriented distance function and their applications to set optimization problems
- Some properties of nonconvex oriented distance function and applications to vector optimization problems
- Necessary optimality conditions for nonsmooth robust optimization problems
- On scalarization and well-posedness in set optimization with a partial set order relation
- Improvement sets and robust multiobjective optimization
- Existence and connectedness of the \(l\)-minimal approximate solutions for set optimization problems: an application in generalized multiobjective robustness
- Dynamic analysis of fractional-order quaternion-valued fuzzy memristive neural networks: vector ordering approach
- A unified characterization of multiobjective robustness via separation
- Robust duality for nonconvex uncertain vector optimization via a general scalarization
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Path connectedness of the efficient solution set for generalized vector quasi-equilibrium problems
- Characterization of set order relations and set optimization problems via conic scalarization
- Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach
- Path connectedness of solution sets for partially ordered set optimization problems
- Convexificators for nonconvex multiobjective optimization problems with uncertain data: robust optimality and duality
- Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
- Treatment of set-valued robustness via separation and scalarization
- Image space analysis for set optimization problems with applications
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
- Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization
- Stabilization and synchronization control of quaternion-valued fuzzy memristive neural networks: nonlinear scalarization approach
- Quasi-synchronization control of quaternion-valued fuzzy memristive neural networks
- Scalarization of multiobjective robust optimization problems
- Scalarization and well-posedness for set optimization problems involving general set less relations
- 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
- Properties of a generalized oriented distance function and applications to set optimization with a variable structure
- Optimality conditions in uncertain vector optimization problems with variable domination structures via Gerstewitz function
This page was built for publication: Characterizations of multiobjective robustness via oriented distance function and image space analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420816)
