A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming

DOI10.1080/10556788.2014.959520zbMath1325.90073OpenAlexW1970571783MaRDI QIDQ2943839

Hui-juan Xiong, Zhichuan Zhu

Publication date: 4 September 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2014.959520

zbMATH Keywords

global convergencemultiobjective programmingnonconvex programminghomotopy method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (1)

A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming

Cites Work

• Unnamed Item
• Homotopy curve tracking in approximate interior point optimization
• An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
• Finding a minimal efficient solution of a convex multiobjective program
• Linear complementarity problems and multiple objective programming
• Linear multiplicative programming
• Finding all maximal efficient faces in multiobjective linear programming
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems

This page was built for publication: A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming