Provably Feasible Contact-Aware Programming
Chen Liang, Xifeng Gao, Kui Wu, Zherong Pan
We introduce an innovative approach to solving Contact-Aware Mathematical Programming (CAMP) by establishing a connection with BiLevel Optimization (BLO) problems. Our method is designed to guarantee convergence to feasible and locally optimal solutions,
under the weaker assumption of a collision-free initial guess.