On the Structure of Convex Piecewise Quadratic Functions
Citation
Source Title
ISSN
Faculty
School
Collection
Abstract
Convex piecewise quadratic functions (CPQF) play an important role in mathematical programming, and yet their structure has not been fully studied. In this paper, these functions are categorized into difference-definite and difference-indefinite types. We show that, for either type, the expressions of a CPQF on neighboring polyhedra in its domain can differ only by a quadratic function related to the common boundary of the polyhedra. Specifically, we prove that the monitoring function in extended linear-quadratic programming is difference-definite. We then study the case where the domain of the difference-definite CPQF is a union of boxes, which arises in many applications. We prove that any such function must be a sum of a convex quadratic function and a separable CPQF. Hence, their minimization problems can be reformulated as monotropic piecewise quadratic programs. © 1992 Plenum Publishing Corporation.
Related items
Showing items related by title, author, creator and subject.
-
Ruan, Ning (2012)Duality is one of the most successful ideas in modern science [46] [91]. It is essential in natural phenomena, particularly, in physics and mathematics [39] [94] [96]. In this thesis, we consider the canonical duality ...
-
Zheng, X.; Sun, X.; Li, D.; Sun, Jie (2014)In this paper we consider cardinality-constrained convex programs that minimize a convex function subject to a cardinality constraint and other linear constraints. This class of problems has found many applications, ...
-
Sun, Jie (2022)We explore a new model in mathematical programming in which a separabie convex piecewise quadratic function is minimized subject to linear constraints. The discussion includes basic theories such as duality, optimality, ...