Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition
From MaRDI portal
Publication:1925395
DOI10.1155/2012/591612zbMath1253.65104WikidataQ58695629 ScholiaQ58695629MaRDI QIDQ1925395
Publication date: 18 December 2012
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/591612
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homotopy interior-point method for a general multiobjective programming problem
- Finding a minimal efficient solution of a convex multiobjective program
- A constraint shifting homotopy method for convex multi-objective programming
- Homotopy method for a general multiobjective programming problem
- A convergent process of price adjustment and global Newton methods
- A combined homotopy interior point method for convex nonlinear programming
- On the extended linear complementarity problem
- 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
- Finite-Dimensional Variational Inequalities and Complementarity Problems