Algorithm Tomas G. Rokicki 2003
U · F B · R2 · U D · F B' · U' D' · R2 · F' B' · D' (14 ltm, 14 ftm, 16* qtm)
Pure Algorithm Walter Randelshofer
U' F2 U2 F2 · R L (F2 U2)2 R' L' · U' (13 ltm, 13* ftm, 20 qtm)
Pure Algorithm Tomas G. Rokicki 2003
U F2 U2 F2 · R' L' (F2 U2)2 R L · U (13 ltm, 13* ftm, 20 qtm)
Pure Algorithm Walter Randelshofer 2010
U R2 U2 R2 · F' B' (R2 U2)2 F B · U (13 ltm, 13* ftm, 20 qtm)
Algorithm Herbert Kociemba 2010
B' MR2 MD2 F' U MF2 MR2 D L' MF2 MD2 R' (12* ltm, 18 ftm, 30 qtm)
Note
A real inversion (point reflection) isn't possible without rearranging some of the stickers. The operation for a corner inversion would be: (ufl,dbr) (dlf,urb) (urf,dlb) (dfr,ubl).