Steepest descent method for uncertain multiobjective optimization problems under finite uncertainty set
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 51950 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- A modified Quasi-Newton method for vector optimization problem
- A new Pareto set generating method for multi-criteria optimization problems
- A sequential quadratic programming method for constrained multi-objective optimization problems
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A steepest descent method for vector optimization
- An algorithm for solving linearly constrained minimax problems
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- Newton's method for multiobjective optimization
- Nonlinear multiobjective optimization
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- Robust optimization
- Selected topics in robust convex optimization
- Steepest descent methods for multicriteria optimization.
This page was built for publication: Steepest descent method for uncertain multiobjective optimization problems under finite uncertainty set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938177)
