2008
DOI: 10.1007/s10589-008-9223-4
|View full text |Cite
|
Sign up to set email alerts
|

An iterative approach for cone complementarity problems for nonsmooth dynamics

Abstract: Iterative methods, Cone complementarity problems, LCP, Complementarity, Contacts, Multibody,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
144
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 116 publications
(147 citation statements)
references
References 35 publications
(69 reference statements)
3
144
0
Order By: Relevance
“…This results in a cone complementarity problem that can be solved with a fixed-point iteration approach, as demonstrated in our earlier work [8].…”
Section: The Overall Dynamical Modelmentioning
confidence: 92%
See 2 more Smart Citations
“…This results in a cone complementarity problem that can be solved with a fixed-point iteration approach, as demonstrated in our earlier work [8].…”
Section: The Overall Dynamical Modelmentioning
confidence: 92%
“…The above-mentioned limitations of the existing LCP approaches led us to develop a novel solution method based on a fixed-point iteration with projection on a convex set and presented in [8]. That method extended the seminal work on iterative LCP solvers by Mangasarian [28] to the LCP case with conical constraints, that is, a cone complementarity problem.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Most importantly, the modified scheme becomes a Cone Complementarity Problem (CCP), which can be solved efficiently by an iterative numerical method that relies on projected contractive maps. Omitting for brevity some of the details discussed in [22], the algorithm makes use of the following vectors and matrices: °i ;a´f°i;n ;°i ;u ;°i ;w g T ; i 2 A;…”
Section: The Time Stepping Solvermentioning
confidence: 99%
“…and ´i parameters are adjusted to control the convergence. Interested readers are referred to [22] for a proof of the convergence of this method.…”
Section: The Time Stepping Solvermentioning
confidence: 99%