Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization.
Q. L. WangS. J. LiKok Lay TeoPublished in: Optim. Lett. (2010)
Keyphrases
- nonlinear programming
- optimality conditions
- variational inequalities
- set valued
- efficient solutions
- higher order
- sensitivity analysis
- linear programming
- convex sets
- primal dual
- optimization problems
- stationary points
- fixed point
- nash equilibrium
- boundary conditions
- pairwise
- heuristic methods
- linear constraints
- markov random field
- optimal solution
- game theory
- evolutionary algorithm
- genetic algorithm
- exact algorithms