Steepest descent method for multiobjective optimization problems of interval-valued maps
From MaRDI portal
Cites work
- A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems
- A limited memory quasi-Newton approach for multi-objective optimization
- A modified Quasi-Newton method for vector optimization problem
- A projected gradient method for vector optimization problems
- A quasi-Newton method with rank-two update to solve interval optimization problems
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- A steepest descent method for vector optimization
- A trust-region approach for computing Pareto fronts in multiobjective optimization
- An interval portfolio selection problem based on regret function
- Barzilai and Borwein's method for multiobjective optimization problems
- Complexity of gradient descent for multiobjective optimization
- Conditional gradient method for multiobjective optimization
- Efficient solution of interval optimization problem
- Generalized Hukuhara-Clarke derivative of interval-valued functions and its properties
- Generalized-Hukuhara subgradient and its application in optimization problem with interval-valued functions
- Gradient-based descent linesearch to solve interval-valued optimization problems under gH-differentiability with application to finance
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Improved front steepest descent for multi-objective optimization
- Improvements to steepest descent method for multi-objective optimization
- Inexact projected gradient method for vector optimization
- Memory gradient method for multiobjective optimization
- Multicriteria Optimization
- Multiple reduced gradient method for multiobjective optimization problems
- Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions
- Newton's method for interval-valued multiobjective optimization problem
- Newton's method for multiobjective optimization
- Nonlinear multiobjective optimization
- On the convergence of steepest descent methods for multiobjective optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence
- Quasi-Newton's method for multiobjective optimization
- Soft methods for handling variability and imprecision. Selected papers based on the presentations at the 4th international conference on soft methods in probability and statistics (SMPS'2008), Toulouse, France, September 8--10, 2008.
- Steepest descent methods for critical points in vector optimization problems
- Steepest descent methods for multicriteria optimization.
- Sufficient optimality conditions and duality theory for interval optimization problem
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
This page was built for publication: Steepest descent method for multiobjective optimization problems of interval-valued maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345708)
