Open AccessBook
Linear complementarity, linear and nonlinear programming
About:
The article was published on 1988-01-01 and is currently open access. It has received 1012 citations till now. The article focuses on the topics: Mixed complementarity problem & Complementarity theory.read more
Citations
More filters
Journal ArticleDOI
The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions
TL;DR: An infeasible non-interior path-following method for nonlinear complementarity problems with uniform P-functions based on the smoothing techniques introduced by Kanzow by restricting the iterates in the neighborhood of the central path by establishing the global linear convergence of this method.
Proceedings ArticleDOI
Trajectory optimization of mechanical hybrid systems using SUMT
Kerim Yunt,Christoph Glocker +1 more
TL;DR: In this article, a unified framework for the determination of non-smooth trajectories for structure-variant mechanical systems along with a computational scheme is proposed, where the optimal control problem is transcribed into a nonlinear programming problem and transformed from the infinite dimensional representation into a finite dimensional representation.
Journal ArticleDOI
A general framework of continuation methods for complementarity problems
TL;DR: A general class of continuation methods is presented which, in particular, solve linear complementarity problems with compositive-plus and L*-matrices and provides a theoretical basis for various methods such as Lemke's method and a method of tracing the central trajectory of linear complementity problems.
Dissertation
Quantitative performance modeling of scientific computations and creating locality in numerical algorithms
TL;DR: The thesis demonstrates that a new method for creating locality, called the blocking covers method, can improve the performance of iterative algorithms including multigrid, conjugate gradient, and implicit time stepping.
Journal ArticleDOI
Modulus-based matrix splitting methods for horizontal linear complementarity problems
TL;DR: Modulus-based matrix splitting iteration methods to horizontal linear complementarity problems are extended and both standard and accelerated methods are considered and their convergence is analyzed.