Adaptive, anisotropic and hierarchical cones of discrete convex functions

DOI10.1007/s00211-015-0732-7zbMath1343.65073arXiv1402.1561MaRDI QIDQ264117

Jean-Marie Mirebeau

Publication date: 5 April 2016

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.1561

zbMATH Keywords

optimization; complexity; convexity; convex programming; convex functions; finite difference methods; numerical experiment; economics; monopolist problem

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

91B24: Microeconomic theory (price theory and economic markets)

52A41: Convex functions and convex programs in convex geometry

26B25: Convexity of real functions of several variables, generalizations