A generalization of generalized Hukuhara Newton's method for interval-valued multiobjective optimization problems
From MaRDI portal
Cites work
- A Method for q-Calculus
- A nonsmooth version of Newton's method
- Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization
- Generalized Minty and Stampacchia Vector Variational-Like Inequalities and Interval-Valued Vector Optimization Problems
- Global optimization using \(q\)-gradients
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Interval-valued fuzzy sets constructed from matrices: application to edge detection
- Karush-Kuhn-Tucker conditions for interval and fuzzy optimization in several variables under total and directional generalized differentiability
- Multi-objective enhanced interval optimization problem
- Multi-objective optimization of multi-microgrid power dispatch under uncertainties using interval optimization
- Multiobjective programming in optimization of interval objective functions -- a generalized approach
- Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions
- Newton's method for a class of nonsmooth functions
- Newton's method for multiobjective optimization
- Nonlinear multiobjective optimization
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- On q-Newton--Kantorovich method for solving systems of equations
- On Minty variational principle for nonsmooth multiobjective optimization problems on Hadamard manifolds
- On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities
- Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds
- Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence
- Steepest descent methods for multicriteria optimization.
- Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
Cited in
(7)- Approximate solutions for a class of multiobjective interval-valued optimization problems with applications
- On conjugate direction-type method for interval-valued multiobjective quadratic optimization problems
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- Levitin-Polyak well-posedness and stability in multiobjective interval-valued optimization problems with applications
- An inexact proximal point method with quasi-distance for quasiconvex multiobjective optimization problems on Riemannian manifolds
- Optimality conditions and duality results for nondifferentiable vector interval-valued optimization problems with G-invex functions
- Fletcher-Reeves-type conjugate direction algorithm for interval-valued multiobjective optimization problems
This page was built for publication: A generalization of generalized Hukuhara Newton's method for interval-valued multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932545)
