Skip to content

Quasiconvex Function

A real-valued function on a convex domain whose sublevel sets are convex, preserving convex feasibility under every threshold without requiring the stronger convex-function inequality.

Version
v3 · 2026-09-06 · History
Domain-specific #
2603
Origin domain
mathematics
Subdomain
convex analysis
Aliases
Quasi-convex function, Quasiconvex objective

Core Idea

A function \(f:C\to\mathbb{R}\) on a convex set is quasiconvex when every sublevel set \(\{x\in C:f(x)\leq \alpha\}\) is convex. Equivalently,

\[ f(\theta x+(1-\theta)y)\leq\max\{f(x),f(y)\} \]

for all \(x,y\in C\) and \(0\leq\theta\leq1\). Thus no point between two domain points rises above both endpoint values.[1]

Quasiconvexity is weaker than convexity. It retains convex threshold-feasibility and is invariant under nondecreasing scalar transformations, but it does not require the graph to lie below the chord joining two values.[2]

The recognition invariant is convex domain + convex lower contour sets at every level + endpoint-maximum segment inequality.

Structural Signature

  • A real-valued function on a convex domain.
  • A nested family of sublevel sets.
  • Convexity of every sublevel set.
  • An equivalent maximum-at-endpoints segment inequality.
  • Convex functions included as a strict subclass.
  • Preservation under nondecreasing scalar composition.
  • Preservation under pointwise maxima.
  • No general preservation under addition.
  • Quasiconcavity obtained by negation.
  • Quasilinearity when both quasi-properties hold.
  • Optimization by convex feasibility tests at candidate levels.

What It Is Not

A quasiconvex function need not be convex, continuous, differentiable, or strictly quasiconvex. Quasiconvexity is not the same as unimodality in several dimensions, though suitable one-dimensional unimodal functions supply examples.

It is also not Morrey quasiconvexity from the calculus of variations, a distinct condition involving integrals under compactly supported perturbations.

Scope of Application

Quasiconvex functions appear in generalized convexity, nonlinear optimization, economic preferences, minimax theory, control design, and fractional programming. A quasiconvex minimization problem can be approached by testing whether convex sublevel constraints are feasible and bisecting on the objective level.[1]

Quasiconcave utility functions encode convex upper contour sets and therefore convex preferences. Classical quasiconcave programming developed economic optimality results under weaker assumptions than concavity.[3]

Clarity

State the domain, codomain, admissible thresholds, and whether the claim is ordinary, strict, or strong quasiconvexity. Specify any continuity or differentiability assumptions separately. Do not infer closure under sums, and do not reverse sublevel and superlevel conventions.

Manages Complexity

Quasiconvexity replaces graph curvature with the geometry of threshold sets. This permits many problems with nonconvex epigraphs to retain convex feasibility structure. It also separates ordinal information—level ordering—from cardinal spacing of function values.

Abstract Reasoning

  1. Verify that the domain is convex.
  2. Choose the sublevel-set or segment-inequality definition.
  3. Prove the condition for every threshold or every segment.
  4. Identify whether strictness is required.
  5. Track transformations that preserve level ordering.
  6. Test operations such as maximum, composition, and partial minimization.
  7. For optimization, convert a target value into a convex feasibility problem.
  8. Avoid importing convex-function consequences that need the stronger Jensen inequality.

Knowledge Transfer

The portable pattern is globally convex threshold regions without linear interpolation of magnitudes. It transfers to preference orderings, feasible-risk contours, level-set methods, and ordinal rescalings. The proposed immediate parent is Convexity.

Examples

Monotone function. A monotone real function on an interval is quasiconvex because each sublevel set is an interval, though the function need not be convex.

Logarithm. On the positive reals, \(\log x\) is concave and quasiconvex: its sublevel sets remain intervals.

Bisection. If constraints \(f(x)\leq t\) have a convex representation, feasible/infeasible tests across (t) locate the optimum without treating (f) as convex.[4]

Structural Tensions

  • Convex level sets versus nonconvex graph.
  • Ordinal invariance versus metric value information.
  • Weak versus strict quasiconvexity.
  • Broad model class versus fewer closure properties.
  • Convex feasibility versus nonconvex objective representation.
  • One-dimensional intuition versus multivariate geometry.

Structural–Framed Character

Nested thresholds, mixture closure, order preservation, and feasibility decomposition are structural. Vector spaces, scalar functions, sublevel sets, and optimization supply the constitutive mathematical frame.

Structural Core vs. Domain Accent

The portable core is convexity of all below-threshold regions. The domain accent is a real-valued function on a convex set and its generalized-convex optimization calculus.

Convexity is the proposed immediate parent. Ordering, Thresholding, Feasibility, Monotonicity, Optimization, and Level Sets are related. Proper Convex Function is a stricter neighboring identity rather than coverage.

The prospective queue contains one strict edge to prime:convexity. No live DAG mutation is authorized.

Relationships to Other Abstractions

Local relationship map for Quasiconvex FunctionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Quasiconvex FunctionDOMAINPrime abstraction: Convexity — is a kind ofConvexityPRIME

Current abstraction Quasiconvex Function Domain-specific

Parents (1) — more general patterns this builds on

  • Quasiconvex Function is a kind of Convexity Prime

    Convexity is the proposed immediate parent.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Quasiconvex Function sits in a sparse region of the domain-specific corpus (86th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Functions, Maps & Integral Structure (10 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With

  • Convex function.
  • Quasiconcave function.
  • Strict quasiconvexity.
  • Quasilinear function.
  • Unimodality in multiple dimensions.
  • Morrey quasiconvexity in the calculus of variations.

References

[1] Stephen Boyd and Lieven Vandenberghe, Convex Optimization (Cambridge University Press, 2004), section 3.4 and section 4.2.5. registry ↩a ↩b

[2] Mordecai Avriel, Walter E. Diewert, Siegfried Schaible, and Israel Zang, Generalized Concavity (Plenum Press, 1988). registry ↩

[3] Kenneth J. Arrow and Alain C. Enthoven, “Quasi-Concave Programming,” Econometrica 29, no. 4 (1961): 779–800, doi:10.2307/1911819. registry ↩

[4] Krzysztof C. Kiwiel, “Convergence and Efficiency of Subgradient Methods for Quasiconvex Minimization,” Mathematical Programming 90 (2001): 1–25, doi:10.1007/PL00011414. registry ↩