scholarly journals A linear complementarity problem involving a subgradient

1988 ◽  
Vol 37 (3) ◽  
pp. 345-351 ◽  
Author(s):  
J. Parida ◽  
A. Sen ◽  
A. Kumar
Keyword(s):  
Convex Function ◽  
Linear Complementarity Problem ◽  
Complementarity Problem ◽  
Nonlinear Complementarity Problem ◽  
Linear Complementarity ◽  
Existence Of A Solution ◽  
Nonlinear Complementarity ◽  
The Matrix ◽  
Square Matrix

A linear complementarity problem, involving a given square matrix and vector, is generalised by including an element of the subdifferential of a convex function. The existence of a solution to this nonlinear complementarity problem is shown, under various conditions on the matrix. An application to convex nonlinear nondifferentiable programs is presented.

scholarly journals On the complex nonlinear complementary problem

1976 ◽  
Vol 14 (1) ◽  
pp. 129-136 ◽  
Author(s):  
J. Parida ◽  
B. Sahoo
Keyword(s):  
Linear Complementarity Problem ◽  
Complementarity Problem ◽  
Nonlinear Complementarity Problem ◽  
Linear Complementarity ◽  
Feasible Point ◽  
Existence Of A Solution ◽  
Polar Cone ◽  
Nonlinear Complementarity ◽  
Image Position ◽  
Nonlinear Mappings

The complex nonlinear complementarity problem considered here is the following: find z such thatwhere S is a polyhedral cone in Cn, S* the polar cone, and g is a mapping from Cn into itself. We study the extent to which the existence of a z ∈ S with g(z) ∈ S* (feasible point) implies the existence of a solution to the nonlinear complementarity problem, and extend, to nonlinear mappings, known results in the linear complementarity problem on positive semi-definite matrices.

scholarly journals Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems

2002 ◽  
Vol 12 (1) ◽  
pp. 17-48
Author(s):  
Goran Lesaja
Keyword(s):  
Global Convergence ◽  
Linear Complementarity Problem ◽  
Interior Point ◽  
Complementarity Problem ◽  
Complementarity Problems ◽  
Nonlinear Complementarity Problem ◽  
Linear Complementarity ◽  
Compact Set ◽  
Interior Point Algorithm ◽  
Nonlinear Complementarity

A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem. The algorithm achieves linear global convergence and quadratic local convergence under the following assumptions: the function satisfies a modified scaled Lipschitz condition, the problem has a strictly complementary solution, and certain submatrix of the Jacobian is nonsingular on some compact set.

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.

An Iterative Approach to Dynamic Elastic-Plastic Analysis

1998 ◽  
Vol 65 (4) ◽  
pp. 811-819 ◽  
Author(s):  
F. Giambanco ◽  
L. Palizzolo ◽  
L. Cirone
Keyword(s):  
Linear Complementarity Problem ◽  
Complementarity Problem ◽  
Degrees Of Freedom ◽  
Linear Complementarity ◽  
Iterative Approach ◽  
Loading History ◽  
Constraint Matrix ◽  
Elastic Plastic ◽  
Recursive Solution ◽  
The Matrix

The step-by-step analysis of structures constituted by elastic-plastic finite elements, subjected to an assigned loading history, is here considered. The structure may possess dynamic and/or not dynamic degrees-of-freedom. As it is well-known, at each step of analysis the solution of a linear complementarity problem is required. An iterative method devoted to solving the relevant linear complementarity problem is presented. It is based on the recursive solution of a linear complementarity, problem in which the constraint matrix is block-diagonal and deduced from the matrix of the original linear complementarity problem. The convergence of the procedure is also proved. Some particular cases are examined. Several numerical applications conclude the paper.

scholarly journals A complex nonlinear complementarity problem

1978 ◽  
Vol 19 (3) ◽  
pp. 437-444 ◽  
Author(s):  
Sribatsa Nanda ◽  
Sudarsan Nanda
Keyword(s):  
Continuous Function ◽  
Complementarity Problem ◽  
Convex Cone ◽  
Existence And Uniqueness ◽  
Nonlinear Complementarity Problem ◽  
Closed Convex Cone ◽  
Uniqueness Of Solutions ◽  
Existence Of A Solution ◽  
Polar Cone ◽  
Nonlinear Complementarity

In this paper we study the existence and uniqueness of solutions for the following complex nonlinear complementarity problem: find z ∈ S such that g(z) ∈ S* and re(g(z), z) = 0, where S is a closed convex cone in Cn, S* the polar cone, and g is a continuous function from Cn into itself. We show that the existence of a z ∈ S with g(z) ∈ int S* implies the existence of a solution to the nonlinear complementarity problem if g is monotone on S and the solution is unique if g is strictly monotone. We also show that the above problem has a unique solution if the mapping g is strongly monotone on S.

Sign in / Sign up

Export Citation Format

Share Document