Piece adding technique for convex maximization problems

DOI10.1007/s10898-009-9506-zzbMath1205.90228OpenAlexW2025133278MaRDI QIDQ604949

Dominique Fortin, Ider Tseveendorj

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s10898-009-9506-z

zbMATH Keywords

local search algorithmglobal search algorithm

Mathematics Subject Classification ID

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 ⋮ Inscribed ball and enclosing box methods for the convex maximization problem

Cites Work

• On-line and off-line vertex enumeration by adjacency lists
• A collection of test problems for constrained global optimization algorithms
• Global optimality conditions for nonconvex optimization
• Handbook of test problems in local and global optimization
• Necessary and sufficient global optimality conditions for convex maximization revisited
• Piecewise-convex maximization problems: algorithm and computational experiments
• Introduction to global optimization
• An algorithm for maximizing a convex function over a simple set
• Extremal problems for convex polygons
• A numerical approach for solving some convex maximization problems
• Piecewise convex maximization approach to multiknapsack
• Piecewise-convex maximization problems.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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