Complementarity constraints are treated as a Lie group under relaxation to enable parameterization that satisfies them by construction in LCQP solvers.
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complementarity by Construction: A Lie-Group Approach to Solving Quadratic Programs with Linear Complementarity Constraints
Complementarity constraints are treated as a Lie group under relaxation to enable parameterization that satisfies them by construction in LCQP solvers.