The quasi-convex Rockafellar theorem
Luigi De Pascale, Paul Pegon
Abstract
Rockafellar showed that every cyclically monotone operator is contained in the subdifferential of a convex function, and characterized the maximal ones. We establish the quasi-convex analogue of this theorem, with no assumption on the operator: in any separable Banach space, a setting we show to be sharp, every cyclically quasi-monotone operator is contained in the normal cone operator of a quasi-convex function. In finite dimension, we characterize maximal cyclically quasi-monotone operators and show that they are maximal quasi-monotone. Unlike in the convex case, the potential is not unique, and we build it from a preference relation obtained through successive preorders. As applications, we extend Afriat's theorem on revealed preferences in economics to infinite data sets, and obtain Kantorovich-type potentials for a supremal optimal transport problem.
Create a lesson
Related papers
A Decomposition-Based Data-Driven Branch-and-Bound Approach for Black-Box Global Optimization
Damilola Fasiku, Wentao Tang
On the Complexity of Linear Programs with Parametric Constraint Matrices
Laurie Boveroux, Margarida Carvalho, Andrea Lodi et al.
Dual-Inertial Bregman Methods with Energy-Based Safeguarding
Kangming Chen
On Partial Optimality in QUBO via Quadratic Posiform Autarkies
Lucas Fabian Naumann, Bjoern Andres
Envelope Cubic Regularized Newton Method for Nonconvex-Strongly-Concave Minimax Optimization
Qihao Zhou, Lesi Chen, Luo Luo et al.
Benign Degeneracy for First-Order Methods in Exact Boolean Moment-SOS Relaxations
Shucheng Kang