Piecewise convex maximization problems: Piece adding technique

DOI10.1007/s10957-010-9763-5zbMath1211.90181OpenAlexW2038350598MaRDI QIDQ535077

Dominique Fortin, Ider Tseveendorj

Publication date: 11 May 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9763-5

zbMATH Keywords

nonconvex optimizationlocal search algorithmconvex maximizationglobal search algorithmpiecewise convex maximization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (4)

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 ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra

Cites Work

• Checking local optimality in constrained quadratic programming is NP- hard
• A collection of test problems for constrained global optimization algorithms
• Handbook of test problems in local and global optimization
• Piecewise-convex maximization problems: algorithm and computational experiments
• Piecewise convex maximization approach to multiknapsack
• Piecewise-convex maximization problems.

This page was built for publication: Piecewise convex maximization problems: Piece adding technique