Piecewise M-stationarity is equivalent to B-stationarity for MPCCs under MPCC-ACQ and reduces the cost of verifying stationarity for NCP-based algorithms.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Reasoning models expend more tokens on association-incompatible tasks than compatible ones, indicating greater effort on counter-stereotypical information, except for Claude 3.7 Sonnet which shows the reverse pattern linked to its bias-focused reasoning.
citing papers explorer
-
Piecewise M-Stationarity and Related Algorithms for Mathematical Programs with Complementarity Constraints
Piecewise M-stationarity is equivalent to B-stationarity for MPCCs under MPCC-ACQ and reduces the cost of verifying stationarity for NCP-based algorithms.
-
Implicit Bias-Like Patterns in Reasoning Models
Reasoning models expend more tokens on association-incompatible tasks than compatible ones, indicating greater effort on counter-stereotypical information, except for Claude 3.7 Sonnet which shows the reverse pattern linked to its bias-focused reasoning.