A New Class of Proximal Algorithms for the Nonlinear Complementarity Problem

2005 ◽  
pp. 549-561
Author(s):  
G.J.P. Da Silva ◽  
P.R. Oliveira
Keyword(s):  
Complementarity Problem ◽  
Nonlinear Complementarity Problem ◽  
Proximal Algorithms ◽  
Nonlinear Complementarity ◽  
New Class

On an application of the complex nonlinear complementarity problem

1976 ◽  
Vol 15 (1) ◽  
pp. 141-148 ◽  
Author(s):  
J. Parida ◽  
B. Sahoo
Keyword(s):  
Minimization Problem ◽  
Complementarity Problem ◽  
Complex Space ◽  
Nonlinear Complementarity Problem ◽  
Polyhedral Cone ◽  
Convex Minimization ◽  
Convex Minimization Problem ◽  
Polyhedral Cones ◽  
Existence Of A Solution ◽  
Nonlinear Complementarity

A theorem on the existence of a solution under feasibility assumptions to a convex minimization problem over polyhedral cones in complex space is given by using the fact that the problem of solving a convex minimization program naturally leads to the consideration of the following nonlinear complementarity problem: given g: Cn → Cn, find z such that g(z) ∈ S*, z ∈ S, and Re〈g(z), z〉 = 0, where S is a polyhedral cone and S* its polar.

Sign in / Sign up

Export Citation Format

Share Document