Star-Convex Functions: Theory & Applications

• Star-convex functions are defined by the property that every segment from a distinguished center to any point lies below or above the affine interpolation, thereby generalizing standard convexity.
• They enable unique optimization guarantees, supporting accelerated methods and global minima discovery even in nonconvex settings.
• These functions are pivotal in optimization theory and geometric analysis, with applications in global optimization, complex analysis, and algorithm design.

Star-convexity is a generalized convexity condition organized around a distinguished center. In optimization, the center is typically a global minimizer $x^*$, and the defining requirement is that every segment from $x^*$ to another point lies below the affine interpolation of function values. In one-dimensional geometric formulations, a point $p$ is a star-center if the segment joining $(p,f(p))$ to $(x,f(x))$ lies entirely in the epigraph or entirely in the hypograph of $f$. In geometric function theory, the term also appears in the closely related class of uniformly starlike functions. Across these settings, star-convexity strictly generalizes ordinary convexity while retaining strong radial or centered structure that is sufficient for geometric representation theorems, majorization inequalities, and nontrivial optimization guarantees (Lee et al., 2015, Hinder et al., 2019, Goswami, 2023, Ali et al., 2011).

1. Definitions and core equivalences

For a function $f:\mathbb R^n\to\mathbb R$ and a fixed point $x_0\in\mathbb R^n$, star-convexity about $x_0$ means that for all $x\in\mathbb R^n$ and all $x^*$0,

$x^*$1

Equivalently, each ray from $x^*$2 is a convex function of radius. In constrained form, if $x^*$3 is convex and $x^*$4, then $x^*$5 is star-convex on $x^*$6 if for every $x^*$7, every $x^*$8, and every $x^*$9,

$p$0

For differentiable $p$1, this is equivalent to the first-order inequality

$p$2

which is the form used repeatedly in optimization analyses (Millan et al., 23 Jul 2025, Lee et al., 2015).

A broader differentiable variant is $p$3-star-convexity: $p$4 is $p$5-star-convex about $p$6 if

$p$7

The case $p$8 recovers convexity, whereas $p$9 weakens it. In the same source, the condition

$(p,f(p))$0

is identified with unimodality along every ray through the minimizer (Lezane et al., 2024).

In the one-dimensional formulation on an interval $(p,f(p))$1, the geometric objects attached to $(p,f(p))$2 are

$(p,f(p))$3

$(p,f(p))$4

$(p,f(p))$5

The function is star-convex if there exists $(p,f(p))$6 such that for every $(p,f(p))$7 and every $(p,f(p))$8, the point

$(p,f(p))$9

lies entirely either in $(x,f(x))$0 or in $(x,f(x))$1. Equivalently, for all $(x,f(x))$2 and $(x,f(x))$3, one of the inequalities

$(x,f(x))$4

or

$(x,f(x))$5

holds. The set of all such centers is the central set $(x,f(x))$6 (Goswami, 2023).

These definitions immediately separate star-convexity from ordinary convexity. Every convex function is star-convex, but the converse need not hold. A second common misconception is that centered convexity along rays should imply regularity comparable to convex analysis; the optimization literature explicitly shows that this is false in the measurable setting (Lee et al., 2015).

2. Algebraic structure and one-dimensional geometry

In the interval setting, several structural properties are immediate. If $(x,f(x))$7 is convex, then every line segment joining two points of $(x,f(x))$8 lies in $(x,f(x))$9, so $f$0. If $f$1 is concave, then $f$2 as well, with the segment lying in $f$3. More generally, the class of star-convex functions on $f$4 is a convex cone, meaning it is closed under non-negative linear combinations, and it is symmetric in the sense that $f$5 is star-convex about $f$6 if and only if $f$7 is star-convex about $f$8 (Goswami, 2023).

A sharp sufficient condition is piecewise convexity or concavity around a selected point $f$9. If $f:\mathbb R^n\to\mathbb R$0 is continuous and one of the following four configurations holds, then $f:\mathbb R^n\to\mathbb R$1 is star-convex with center $f:\mathbb R^n\to\mathbb R$2:

1. $f:\mathbb R^n\to\mathbb R$3 is convex and $f:\mathbb R^n\to\mathbb R$4 is convex.
2. $f:\mathbb R^n\to\mathbb R$5 is concave and $f:\mathbb R^n\to\mathbb R$6 is concave.
3. $f:\mathbb R^n\to\mathbb R$7 is convex and $f:\mathbb R^n\to\mathbb R$8 is concave.
4. $f:\mathbb R^n\to\mathbb R$9 is concave and $x_0\in\mathbb R^n$0 is convex.

In the first two cases, every segment from $x_0\in\mathbb R^n$1 to $x_0\in\mathbb R^n$2 lies wholly in $x_0\in\mathbb R^n$3 or wholly in $x_0\in\mathbb R^n$4. In the mixed cases, one half-segment lies in $x_0\in\mathbb R^n$5 and the other in $x_0\in\mathbb R^n$6, but $x_0\in\mathbb R^n$7 still remains a valid star-center (Goswami, 2023).

This formulation makes the centered nature of the concept explicit. Convexity imposes inequalities between all pairs of points, whereas star-convexity only constrains segments attached to a distinguished center. A plausible implication is that star-convexity is best understood ոչ as a small perturbation of convexity, but as a radial geometry with a privileged anchor point.

3. Star-convex bodies and generalized variants

The one-dimensional theory in turn induces planar star-convex sets. A subset $x_0\in\mathbb R^n$8 is star-convex, or star-shaped, if there exists $x_0\in\mathbb R^n$9 such that for every $x_0$0, the segment from $x_0$1 to $x_0$2 lies entirely in $x_0$3. If $x_0$4 is continuous and star-convex about $x_0$5, then in the four piecewise convexity/concavity configurations above one obtains corresponding star-convex subsets of $x_0$6 centered at $x_0$7: unions of two half-epigraphs, two half-hypographs, or a mixed epi/hypo union, depending on the left and right behavior of $x_0$8 (Goswami, 2023). This realizes star-convexity of a scalar function as a star-shaped planar body whose boundary is the graph $x_0$9.

A distinct line of generalization is $x\in\mathbb R^n$0-$x\in\mathbb R^n$1-star-convexity on convex subsets $x\in\mathbb R^n$2 of Banach spaces. For $x\in\mathbb R^n$3 and a modulus $x\in\mathbb R^n$4, a function $x\in\mathbb R^n$5 is $x\in\mathbb R^n$6-$x\in\mathbb R^n$7-star-convex if for every $x\in\mathbb R^n$8 and every $x\in\mathbb R^n$9,

$x^*$00

If $x^*$01, this reduces to $x^*$02-star-convexity; if in addition $x^*$03, one recovers the usual convexity condition. The parameter $x^*$04 dilutes the weight placed on $x^*$05, and $x^*$06 contributes a perturbation term depending on distance (Lachescu et al., 2022).

Within ordered Banach spaces, this generalized notion supports an extension of the Hardy–Littlewood–Pólya inequality of majorization. If $x^*$07 and $x^*$08 satisfy the preorder $x^*$09, and if $x^*$10 is Gâteaux-differentiable, $x^*$11-$x^*$12-star-convex, and has isotone differential $x^*$13, then

$x^*$14

The same conclusion also holds under the weaker preorder $x^*$15 provided $x^*$16 itself is isotone (Lachescu et al., 2022).

The same paper records a perspective construction: if $x^*$17 is $x^*$18-$x^*$19-star-convex on a cone $x^*$20, then

$x^*$21

is again $x^*$22-$x^*$23-star-convex. Concrete examples include $x^*$24 on $x^*$25, which is $x^*$26-star-convex but not convex, and $x^*$27 on $x^*$28, which is $x^*$29-star-convex; its perspective

$x^*$30

has isotone differential on $x^*$31 (Lachescu et al., 2022).

4. Examples, nonconvexity, and pathological behavior

The literature supplies a large family of star-convex functions that are not convex. Examples in one and several variables include $x^*$32 on $x^*$33, $x^*$34 on $x^*$35, and $x^*$36 on $x^*$37, each star-convex about the origin or $x^*$38 but nonconvex (Millan et al., 23 Jul 2025, Hinder et al., 2019). Any continuous, nonnegative, positively homogeneous function of degree $x^*$39 is star-convex about the origin, since $x^*$40 for $x^*$41 (Millan et al., 23 Jul 2025).

The class also includes generalized $x^*$42 distances with subunit exponents. For any real $x^*$43,

$x^*$44

is star-convex with star center $x^*$45, while it is nonconvex when $x^*$46. More generally, if $x^*$47 and $x^*$48 are star-convex with a common star center $x^*$49 and $x^*$50, then for any real $x^*$51,

$x^*$52

is star-convex about $x^*$53; for $x^*$54 convexity fails but star-convexity is preserved. Another flexible construction is the arbitrary radial extension

$x^*$55

with $x^*$56 any bounded measurable function on the unit sphere and $x^*$57, yielding star-convexity about the origin even when transverse behavior is discontinuous or highly oscillatory (Lee et al., 2015).

These examples are matched by strong negative results. A measurable star-convex function can be discontinuous almost everywhere, can lack subgradients, and can oscillate arbitrarily fast transverse to the optimal ray. One can encode an exponentially large unknown parameter into behavior on an exponentially small set of rational directions, so deterministic gradient or cutting-plane methods fail. The class of Lebesgue-measurable star-convex functions on $x^*$58 has cardinality $x^*$59, whereas the class of continuous functions has cardinality $x^*$60. There also exist smooth star-convex functions for which any deterministic gradient oracle returns information independent of the true optimum in one coordinate (Lee et al., 2015).

At the same time, several sources describe star-convexity as a model for global radial unimodality. One paper states that star-convex functions are strictly unimodal on all lines through a minimizer, and another notes that certain neural-network empirical losses appear star-convex in neighborhoods of their global minima, while many machine-learning losses appear empirically to be star-convex in large basins around global minimizers (Lezane et al., 2024, Hinder et al., 2019). This suggests that the concept occupies an intermediate position: it is substantially weaker than convexity, yet still strong enough to exclude spurious local minima along rays emanating from a minimizer.

5. Optimization algorithms and complexity theory

The optimization literature treats star-convexity as a structure that permits global or accelerated methods beyond the convex setting.

Method	Setting	Guarantee
Randomized cutting-plane / ellipsoid method	Lebesgue-measurable star-convex $x^*$61 with weak sampling-oracle access	Time $x^*$62; returns either a Gaussian with $x^*$63 or an ellipsoid of radius $x^*$64 around $x^*$65 (Lee et al., 2015)
Accelerated first-order method with binary line search	$x^*$66-smooth star-convex $x^*$67	$x^*$68 total function and gradient evaluations; lower bound $x^*$69 for deterministic first-order methods (Hinder et al., 2019)
Accelerated mirror descent + binary search	$x^*$70-star-convex, $x^*$71-weakly smooth $x^*$72 in an arbitrary norm, with $x^*$73-uniformly convex mirror map $x^*$74	$x^*$75; total oracle complexity $x^*$76 (Lezane et al., 2024)
Frank–Wolfe	Differentiable star-convex $x^*$77 with $x^*$78-Lipschitz gradient over compact convex $x^*$79	$x^*$80 for objective values and Frank–Wolfe duality gap under diminishing, Armijo-type, and Lipschitz-based stepsizes (Millan et al., 23 Jul 2025)

The 2015 global algorithm addresses the maximally unrestricted setting of measurable star-convexity. Its core devices are a blurred logarithm

$x^*$81

randomized smoothing by Gaussian convolution, and an ellipsoid method that intentionally samples outside the current feasible region in thin directions. The stated result is polynomial in the number of digits of accuracy, contrasting with the cited Nesterov–Polyak algorithm, which requires Lipschitz continuity of $x^*$82 and has $x^*$83 complexity, hence exponential dependence on the number of bits of accuracy (Lee et al., 2015).

For smooth star-convexity, accelerated first-order theory is substantially sharper. When $x^*$84 in quasar-convexity, star-convex minimization is handled by an AGD-style scheme with a binary search over a one-dimensional momentum parameter. If $x^*$85 is $x^*$86-smooth and $x^*$87, then after

$x^*$88

iterations the method outputs $x^*$89 with $x^*$90, and the total oracle complexity is

$x^*$91

The same source proves a lower bound of $x^*$92 on the number of gradient evaluations required by any deterministic first-order method, so the upper bound is near-optimal up to the logarithmic factor (Hinder et al., 2019).

The non-Euclidean extension replaces Euclidean quadratic regularization by a Bregman geometry generated by a $x^*$93-uniformly convex mirror map and accommodates $x^*$94-weak smoothness,

$x^*$95

Each outer iteration performs a binary search on a segment between a mirror-descent center and an aggregate point to find $x^*$96, then applies a Bregman proximal step and a proximal aggregate step. In the classical smooth case $x^*$97, the rate becomes $x^*$98 up to $x^*$99 factors. For $p$00-norms with $p$01, the paper states nearly-optimal complexities up to $p$02 factors and matching lower bounds in the convex setting for $p$03 (Lezane et al., 2024).

The 2025 Frank–Wolfe analysis shows that classical $p$04 complexity extends from convex to star-convex objectives over compact convex sets. Both the objective residual and the duality gap decay at this rate under diminishing, Armijo-type, and Lipschitz-based stepsize rules, and the diminishing and Armijo strategies do not require prior knowledge of Lipschitz or curvature constants. The same source contrasts this with general nonconvex Frank–Wolfe, where only $p$05 is generally available for $p$06 in the absence of star-convex structure (Millan et al., 23 Jul 2025).

6. Uniformly starlike functions and open directions

In geometric function theory, uniformly starlike functions provide a distinct but related use of the term. Let $p$07 be the class of analytic functions in the unit disk $p$08 normalized by $p$09 and $p$10, and let $p$11 be the univalent subclass. A function $p$12 is uniformly starlike, abbreviated UST, if it maps every circular arc $p$13 whose center $p$14 also lies in $p$15 onto a curve which is starlike with respect to $p$16. Goodman’s two-point criterion gives

$p$17

Taking $p$18 yields $p$19, so $p$20, but no single-variable equivalent of the full two-point condition is known (Ali et al., 2011).

The survey records several quantitative results. If $p$21, then $p$22. For $p$23, if

$p$24

then

$p$25

The exact Koebe constant is unknown, but the survey states $p$26. Radius problems are also partially resolved: $p$27, $p$28, and $p$29 for the convex class $p$30 (Ali et al., 2011).

The class has a distinctive structural profile. UST is not a linear-invariant family; disk automorphisms of a function in UST need not remain in UST. It is preserved under rotations $p$31 and under dilations $p$32, $p$33. The Koebe function $p$34 shows that $p$35 is strict, since $p$36. Open problems include determining the sharp constants in the coefficient estimates, the exact sharp growth, distortion and rotation estimates, the exact Koebe constant, and the exact UST-radius of $p$37 and of the class $p$38 of pre-starlike functions of order $p$39 (Ali et al., 2011).

Open questions also remain in the generalized convexity literature outside complex analysis. For $p$40-$p$41-star-convex functions, the cited problems include Hyers–Ulam-type stability for approximately $p$42-$p$43-star-convex maps, local approximate $p$44-star-convexity, $p$45-$p$46-$p$47-star-convexity based on weighted power means, and Sherman-type inequalities in ordered Banach spaces (Lachescu et al., 2022). Together with the optimization results above, these problems indicate that star-convexity is not a single closed theory but a family of centered convexity principles that recur in real analysis, convex geometry, Banach-space inequalities, complex analysis, and nonconvex optimization.