A Newton method for uncertain multiobjective optimization problems with finite uncertainty sets
From MaRDI portal
Cites work
- A PRP-based residual method for large-scale monotone nonlinear equations
- A quadratically convergent Newton method for vector optimization
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem
- A unified characterization of multiobjective robustness via separation
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Asymptotically stable high-order neutral cellular neural networks with proportional delays and \(D\) operators
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Decision uncertainty in multiobjective optimization
- Dominance for multi-objective robust optimization concepts
- scientific article; zbMATH DE number 1356716 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- New order relations in set optimization
- Newton's method for multiobjective optimization
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- On cone convexity of set-valued maps
- On robust multiobjective optimization
- Partial order relations on family of sets and scalarizations for set optimization
- Robust convex optimization
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Robust discrete optimization and its applications
- Robust multi-objective optimal switching control arising in 1,3-propanediol microbial fed-batch process
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- 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
- Variational methods in partially ordered spaces
- Vector optimization problems and their solution concepts
Cited in
(7)- Proper subdifferential of set-valued maps and its applications in linear spaces
- Cubic regularization technique of the Newton method for vector optimization
- A method for uncertain linear optimization problems through polytopic approximation of the uncertainty set
- A quasi-Newton method to solve uncertain multiobjective optimization problems with uncertainty set of finite cardinality
- A general gH-gradient efficient-direction method for solving fuzzy optimization problems
- A tunneling method for nonlinear multi-objective optimization problems
- Optimality conditions for non-smooth interval-valued optimization problems with robust constraints
This page was built for publication: A Newton method for uncertain multiobjective optimization problems with finite uncertainty sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023406)