Homotopy method for a general multiobjective programming problem

DOI10.1007/s10957-008-9366-6zbMath1211.90219OpenAlexW2034744656MaRDI QIDQ937132

Guangming Yao, Wen Song

Publication date: 20 August 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-008-9366-6

zbMATH Keywords

efficient solutionshomotopy methodsKKT conditionsmultiobjective programming problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Interior-point methods (90C51)

Related Items

Homotopy method for a class of multiobjective optimization problems with equilibrium constraints, Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition, Homotopy interior-point method for a general multiobjective programming problem, Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming, A noninterior path following algorithm for solving a class of multiobjective programming problems, A constraint shifting homotopy method for convex multi-objective programming, A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming, Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a minimal efficient solution of a convex multiobjective program
• Second-order conditions for efficiency in nonsmooth multiobjective optimization problems
• A combined homotopy interior point method for general nonlinear programming problems
• A combined homotopy interior point method for convex nonlinear programming
• Classical Optimality Conditions under Weaker Assumptions
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• The Projective SUMT Method for Convex Programming
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space