Piecewise-convex maximization problems: algorithm and computational experiments

DOI10.1023/A:1016221931922zbMath1026.90068OpenAlexW1683681950MaRDI QIDQ1862175

Dominique Fortin, Ider Tseveendorj

Publication date: 10 March 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016221931922

zbMATH Keywords

optimality conditionslocal search algorithmglobal search algorithmpiecewise convex functionnonconvex and nonsmooth problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (9)

Reverse convex problems: an approach based on optimality conditions ⋮ Piece adding technique for convex maximization problems ⋮ Covering balls and \(\mathcal{HT}\)-\textit{differential} for convex maximization ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ Attractive force search algorithm for piecewise convex maximization problems ⋮ Piecewise convex maximization problems: Piece adding technique ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Piecewise convex maximization approach to multiknapsack ⋮ Global minimization via piecewise-linear underestimation

This page was built for publication: Piecewise-convex maximization problems: algorithm and computational experiments