Piecewise convex maximization problems: Piece adding technique

DOI10.1007/S10957-010-9763-5MaRDI QIDQ535077zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Piece adding technique for convex maximization problems
• Piecewise-convex maximization problems: algorithm and computational experiments
• scientific article; zbMATH DE number 3939107
• Piecewise-convex maximization problems.
• Survey of piecewise convex maximization and PCMP over spherical sets

Cites work

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

Cited in

(7)

• Survey of piecewise convex maximization and PCMP over spherical sets
• Minimizing Piecewise-Concave Functions Over Polyhedra
• Piecewise-convex maximization problems: algorithm and computational experiments
• Piece adding technique for convex maximization problems
• Attractive force search algorithm for piecewise convex maximization problems
• Covering balls and \(\mathcal{HT}\)-\textit{differential} for convex maximization
• Piecewise-convex maximization problems.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535077)