Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition

DOI10.1155/2012/591612MaRDI QIDQ1925395zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 18 December 2012

Published in Abstract and Applied Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

KKT systemgeneral multiobjective programming probleminterior point homotopy continuation method

Mathematics Subject Classification ID

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

Recommendations

• The homotopy method for solving multiobjective programming problems under weak quasi-normal cone condition
• Homotopy method for multi-objective programming problems with equilibrium constraints under quasi-normal cone condition
• Homotopy method for a general multiobjective programming problem
• A homotopy method for multiobjective programming problems
• Homotopy interior-point method for a general multiobjective programming problem
• A homotopy interior method for a general multi-objective programming problem
• Homotopy method for a class of multiobjective optimization problems with equilibrium constraints
• Homotopy method for multi-objective programming problems
• scientific article; zbMATH DE number 5284144
• Generalized homotopy approach to multiobjective optimization.

Cites work

• scientific article; zbMATH DE number 3682672 (Why is no real title available?)
• scientific article; zbMATH DE number 3069611 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• A combined homotopy interior point method for convex nonlinear programming
• A constraint shifting homotopy method for convex multi-objective programming
• 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 Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Finding a minimal efficient solution of a convex multiobjective program
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Homotopy interior-point method for a general multiobjective programming problem
• Homotopy method for a general multiobjective programming problem
• On the extended linear complementarity problem
• The Projective SUMT Method for Convex Programming

Cited in

(9)

• A homopoty interior point method for solving multiobjective programming problems
• Homotopy method for multi-objective programming problems
• A homotopy interior method for a general multi-objective programming problem
• Homotopy method for multi-objective programming problems with equilibrium constraints under quasi-normal cone condition
• A homotopy method for solving nonconvex optimization with a weak quasi normal cone condition
• Homotopy interior-point method for a general multiobjective programming problem
• Homotopy method for a general multiobjective programming problem
• The homotopy method for solving multiobjective programming problems under weak quasi-normal cone condition
• A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming

This page was built for publication: Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition

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