Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets

DOI10.23952/jnva.7.2023.5.08OpenAlexW4387260730MaRDI QIDQ6085818

Unnamed Author, Md Abu Talhamainuddin Ansary, Debdas Ghosh, Nihar Kumar Mahato, Yekini Shehu

Publication date: 12 December 2023

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.23952/jnva.7.2023.5.08

zbMATH Keywords

uncertaintyNewton's methodrobust optimisationline search techniquesrobust efficiencymultiobjective optimisation problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Robustness in mathematical programming (90C17)

Cites Work

• Minmax robustness for multi-objective optimization problems
• Selected topics in robust convex optimization
• An algorithm for solving linearly constrained minimax problems
• Steepest descent methods for multicriteria optimization.
• A steepest descent method for vector optimization
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• On \(q\)-Newton's method for unconstrained multiobjective optimization problems
• A sequential quadratic programming method for constrained multi-objective optimization problems
• Optimization theory and methods. Nonlinear programming
• On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
• A modified Quasi-Newton method for vector optimization problem
• Newton's Method for Multiobjective Optimization
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
• Multicriteria Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets