An algorithm to solve polytopic set optimization problem based on a partial set order relation

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Vectorization in set optimization
Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
Existence and Lagrangian duality for maximization of set-valued functions
Theory and computation of disturbance invariant sets for discrete-time linear systems
Partial order relations on family of sets and scalarizations for set optimization
Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
An algorithmic approach to multiobjective optimization with decision uncertainty
Optimality conditions in set-valued optimization problem with respect to a partial order relation via directional derivative
A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
A note on semicontinuity of the solution mapping for parametric set optimization problems
Scalarizations for a set optimization problem using generalized oriented distance function
A derivative-free descent method in set optimization
Note: An algorithm to solve polyhedral convex set optimization problems
Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
Set-valued optimization in welfare economics
An algorithm to solve polyhedral convex set optimization problems
Optimality conditions in set-valued optimization problems with respect to a partial order relation by using subdifferentials
A Vectorization Scheme for Nonconvex Set Optimization Problems
Convergence of the solution sets for set optimization problems
Set-valued Optimization
Convex Analysis
Solving set-valued optimization problems using a multiobjective approach
Convex analysis and global optimization
Convergence, scalarization and continuity of minimal solutions in set optimization

This page was built for publication: An algorithm to solve polytopic set optimization problem based on a partial set order relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665565)