The DOI matches its Crossref record.
On the monotonicity of the gradient of a convex function
Open accessAbstract
The object of this note is to present some elementary theorems concerning convex functions in ^-dimensions and, more generally, topological vector spaces.These theorems are all essentially generalizations of the theorem "the derivative of a convex function of one real variable is monotonic non-decreasing", and appear to have been overlooked in the literature.Let X be a topological vector space with real scalars, and Y the conjugate-space (space of continuous linear functionals) of X.We shall write y(x), for x e X, y e Y, as ζx, y) to facilitate applications to Hubert space.The convex (real-valued) function φ will always be presumed to have convex domain Da X, and satisfies the inequalityfor all x lf x 2 in D, all s ^ 0, t ^ 0, s + t = 1.The graph G of Φ is a subset of the topological vector space X + R, and it is obvious that the "set of points lying above the graph of Φ": A={(x, r): x e D, r^Φ(x)} is a convex set.(This condition is also sufficient for the convexity of φ.)DEFINITION 1. Asetίclx Fis called a monotonic set provided that, for all (x l9 y x ) and (x 2 , y 2 ) in E, ^ 0.DEFINITION 2. ([6]) For Del, a function F:D-+Y is called πionotonic provided the graph of F is a monotonic set.Now, it is well known that the conjugate space of X + B is Y + R, and that a closed hyperplane in X + R is of the form {(x, r): ζx, y o y + rr Q = a} for some y o e Y, r o e R, ae R. (See [2], p. 26, Theoreme 1.)This representation is non-unique, but if r 0 Φ 0, the equation ζx, y o y + rr Q = a can be solved for r, and the resulting equation is, in an obvious sense, unique.These facts motivate the following definition: DEFINITION 3. A gradient hyperplane iϊof Φ is a closed hyperplane of support to A, the set of points lying above the graph of Φ in X + R, such that Jϊcan be written in the form {(x, r): r = φ(x 0 ) + ζx -x 0 , y o y\.(Note the analogy with the first two terms of a Taylor-series for φ.) REMARK 1.This definition might be considered inappropriate if Φ is not everywhere-defined over X; this problem will not concern us here.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
On the maximal monotonicity of subdifferential mappings
Rockafellar, R. (1970) · Pacific Journal of Mathematics · doi:10.2140/pjm.1970.33.209 · Cited by 740
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Nonlinear maximal monotone operators in Banach space
Browder, F. E. (1968) · Mathematische Annalen · doi:10.1007/bf01418765 · Cited by 261
Metadata
- Authors
- Minty, G.
- Venue
- Pacific Journal of Mathematics
- Publisher
- Mathematical Sciences Publishers
- Published
- 1964-03-01
- Volume
- 14
- Issue
- 1
- Pages
- 243-247
- ISSN
- 0030-8730 (ISSN-L)
- OpenAlex
- W2063938506
- Cited by
- 205
- References
- 0
- FWCI
- 23.55
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the monotonicity of the gradient of a convex function. https://app.cochat.ai/papers/10.2140/pjm.1964.14.243
- The paper
- Minty, G. (1964). On the monotonicity of the gradient of a convex function. Pacific Journal of Mathematics. https://doi.org/10.2140/pjm.1964.14.243
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.