A nonmonotone line search method for constrained multiobjective optimization problems

DOI10.1007/S40065-025-00547-7MaRDI QIDQ6835991zbMATH OpenFDO

Authors Wonchol Hwang, Yunchol Jong, Chungil Kim

Publication date 27 March 2026

Published in Arabian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40065-025-00547-7

Mathematics Subject Classification ID

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

Cites work

• A diagonal-sparse quasi-Newton method for unconstrained optimization problem
• A limited memory quasi-Newton approach for multi-objective optimization
• A method for constrained multiobjective optimization based on SQP techniques
• A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A projected gradient method for vector optimization problems
• A steepest descent method for vector optimization
• A trust-region approach for computing Pareto fronts in multiobjective optimization
• An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
• Benchmarking optimization software with performance profiles.
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
• Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
• Inexact projected gradient method for vector optimization
• IT-CEMOP: an iterative co-evolutionary algorithm for multiobjective optimization problem with nonlinear constraints
• Newton's method for multiobjective optimization
• Nonmonotone adaptive trust region method with line search based on new diagonal updating
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application
• Nonmonotone line searches for unconstrained multiobjective optimization problems
• Nonsmooth multiobjective programming with quasi-Newton methods
• On the convergence of the projected gradient method for vector optimization
• On the nonmonotone line search
• Quasi-Newton methods for solving multiobjective optimization
• Relaxation of constraints in lexicographic multiobjective programming problems
• Steepest descent methods for multicriteria optimization.
• Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
• Twenty years of continuous multiobjective optimization in the twenty-first century

This page was built for publication: A nonmonotone line search method for constrained multiobjective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835991)