Homotopy method for a class of multiobjective optimization problems with equilibrium constraints
From MaRDI portal
Publication:2358471
DOI10.3934/jimo.2016005zbMath1364.90421OpenAlexW2321784383MaRDI QIDQ2358471
Qinghuai Liu, Shugong Zhang, Chun-Yang Zhang
Publication date: 15 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016005
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Numerical computation of solutions to systems of equations (65H10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations
- Homotopy interior-point method for a general multiobjective programming problem
- Homotopy methods for solving variational inequalities in unbounded sets
- Homotopy method for solving ball-constrained variational inequalities
- Optimization problems with equilibrium constraints and their numerical solution.
- Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Homotopy method for a general multiobjective programming problem
- Multiobjective optimization problems with equilibrium constraints
- A convergent process of price adjustment and global Newton methods
- Multiobjective optimization problem with variational inequality constraints
- A continuation method for solving fixed points of self-mappings in general nonconvex sets
- A smoothing homotopy method for variational inequality problems on polyhedral convex sets
- Necessary conditions in multiobjective optimization with equilibrium constraints
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Stability Analysis for Parametric Mathematical Programs with Geometric Constraints and Its Applications
- Mathematical Programs with Equilibrium Constraints
