Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition
From MaRDI portal
Publication:1925395
DOI10.1155/2012/591612zbMATH Open1253.65104OpenAlexW2098333321WikidataQ58695629 ScholiaQ58695629MaRDI QIDQ1925395FDOQ1925395
Authors: Yanyan Li
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
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
- Generalized homotopy approach to multiobjective optimization.
Cites Work
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A combined homotopy interior point method for convex nonlinear programming
- 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
- A convergent process of price adjustment and global Newton methods
- Title not available (Why is that?)
- On the extended linear complementarity problem
- Homotopy interior-point method for a general multiobjective programming problem
- Finding a minimal efficient solution of a convex multiobjective program
- Homotopy method for a general multiobjective programming problem
- Title not available (Why is that?)
- A constraint shifting homotopy method for convex multi-objective programming
Cited In (8)
- Homotopy method for multi-objective programming problems
- A homotopy interior method for a general multi-objective programming problem
- 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
- A homopoty interior point method for solving multiobjective programming problems
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)