Many modern applications rely on convex optimization, which offers a rich modeling paradigm as well as strong theoretical guarantees and computational advantages. Convex duality often plays a central role. I will describe the geometry behind a simple form of convex duality based on polarity of convex cones, and show how it can be used to develop a computationally efficient algorithm for the phase-retrieval problem in x-ray crystallography.