Paperlane

no. 5 · Friday 30 October 2026

Optimality Conditions and Solution Set Characterisations of Convex Minimal Time Optimisation Problems

Doan Huu Hieu and Nguyen Duy Cuong

math.OC · 29 pp

Abstract

The paper studies convex minimisation problems involving a composition of a coordinatewise nondecreasing convex function with a finite family of nonnegative, locally Lipschitz continuous and convex functions. We establish complete dual optimality conditions and characterise the entire solution set using multipliers and subgradients associated with a given solution. The results are applied to norm optimisation problems involving minimal time functions with different convex dynamics sets and convex target sets. The sum, maximum and p-norms yield minimal time versions of the Fermat–Torricelli, Chebyshev centre and p-Fermat–Torricelli problems, respectively. Examples in finite and infinite dimensional spaces are provided to illustrate the solution set characterisations.

comments
29 pages, 8 figures
fields
Optimization and Control, Functional Analysis
pdf ↗ page arXiv:2610.38553 ↗