What is another word for convex duality?
Pronunciation: [kɒnvˈɛks djuːˈalɪti] (IPA) 
Convex duality is a term used in optimization theory to describe a mathematical relationship between two convex functions. It has numerous synonyms and related terms, including Lagrange duality, Fenchel duality, conic duality, and dual optimization. These terms describe different aspects of the same concept and are used in different contexts within optimization theory. In Lagrange duality, the original problem is transformed into a new form that is easier to solve. Fenchel duality is used when the objective function is given by the conjugate of a convex function. Conic duality is used in the context of conic optimization problems, while dual optimization refers to the process of finding the optimal solution to a dual problem.
