A general gH-gradient efficient-direction method for solving fuzzy optimization problems
From MaRDI portal
A general \(gH\)-gradient efficient-direction method for solving fuzzy optimization problems
Cites work
- A Bregman projection algorithm with self adaptive step sizes for split variational inequality problems involving non-Lipschitz operators
- A Davidon-Fletcher-Powell Type Quasi-Newton Method to Solve Fuzzy Optimization Problems
- A new stepsize for the steepest descent method
- A Newton method for uncertain multiobjective optimization problems with finite uncertainty sets
- A note on multiobjective optimal control in presence of asymptotical constraints
- Convergence analysis of a projected gradient method for multiobjective optimization problems
- Convergence of the Mass-Transport Steepest Descent Scheme for the Subcritical Patlak–Keller–Segel Model
- Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces
- Cubic interpolation: a line search technique for fuzzy optimization problems
- Fuzzy sets
- Generalized Hukuhara Gâteaux and Fréchet derivatives of interval-valued functions and their application in optimization with interval-valued functions
- On inertial subgradient extragradient rule for monotone bilevel equilibrium problems
- On relaxed inertial projection and contraction algorithms for solving monotone inclusion problems
- Primal-dual damping algorithms for optimization
- Steepest descent methods for multicriteria optimization.
This page was built for publication: A general \(gH\)-gradient efficient-direction method for solving fuzzy optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7324479)