Homotopy interior-point method for a general multiobjective programming problem

DOI10.1155/2012/497345MaRDI QIDQ442940zbMATH OpenOpenAlexDBLPWikidataFDO

Authors X. Zhao, Shugong Zhang, Qinghuai Liu

Publication date 6 August 2012

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/497345

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Review text

Summary: We present a combined homotopy interior-point method for a general multiobjective programming problem. For solving the KKT points of the multiobjective programming problem, the homotopy equation is constructed. We prove the existence and convergence of a smooth homotopy path from almost any initial interior point to a solution of the KKT system under some basic assumptions.

Recommendations

• A homotopy interior method for a general multi-objective programming problem
• Homotopy method for a general multiobjective programming problem
• Homotopy method for multi-objective programming problems
• Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition
• A homotopy method for multiobjective programming problems

Cites work

• A combined homotopy interior point method for convex nonlinear programming
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• A convergent process of price adjustment and global Newton methods
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• Finding a minimal efficient solution of a convex multiobjective program
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Homotopy method for a general multiobjective programming problem
• scientific article; zbMATH DE number 3682672 (Why is no real title available?)
• On the extended linear complementarity problem
• The Projective SUMT Method for Convex Programming

Cited in

(17)

• Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition
• Homotopy method for a class of multiobjective optimization problems with equilibrium constraints
• The aggregate homotopy interior-point method for multiobjective programming problems with equality and inequality constraints
• scientific article; zbMATH DE number 7234885 (Why is no real title available?)
• Homotopy method for multi-objective programming problems
• scientific article; zbMATH DE number 4033509 (Why is no real title available?)
• scientific article; zbMATH DE number 1527807 (Why is no real title available?)
• scientific article; zbMATH DE number 1778421 (Why is no real title available?)
• A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming
• Optimization problem in multi-homogeneous homotopy method
• A homotopy method for multiobjective programming problems
• The aggregate homotopy interior-point method for multi-objective convex programming
• A homopoty interior point method for solving multiobjective programming problems
• A homotopy interior method for a general multi-objective programming problem
• Homotopy-interior point algorithm for solving set of effective solutions of double-objective convex programming
• On KKT points of homogeneous programs
• Homotopy method for a general multiobjective programming problem

This page was built for publication: Homotopy interior-point method for a general multiobjective programming problem

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