Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems

Details Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems

2000-05-23

arxiv.org/abs/math/0005229v1

Mathematics

Combinatorics

14 pages

Scientific paper

General Successive Convex Relaxation Methods (SRCMs) can be used to compute the convex hull of any compact set, in an Euclidean space, described by a system of quadratic inequalities and a compact convex set which is not very complicated. Linear Complementarity Problems (LCPs) make an interesting and rich class of structured nonconvex optimization problems. In this paper, we study a few of the specialized lift-and-project methods and some of the possible ways of applying the general SCRMs to LCPs and related problems.

Affiliated with

Also associated with

No associations

Rating

Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473382