Attractive force search algorithm for piecewise convex maximization problems

DOI10.1007/s11590-011-0395-yzbMath1259.90100OpenAlexW2043163275MaRDI QIDQ694170

Ider Tseveendorj, Dominique Fortin

Publication date: 11 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0395-y

zbMATH Keywords

local search algorithmconvex maximizationglobal search algorithmpiecewise convex maximization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

Survey of Piecewise Convex Maximization and PCMP over Spherical Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Piecewise convex maximization problems: Piece adding technique
• Piece adding technique for convex maximization problems
• On the local convergence of adjoint Broyden methods
• Handbook of test problems in local and global optimization
• Multicriteria optimization
• Piecewise-convex maximization problems: algorithm and computational experiments
• Introduction to global optimization
• A survey of recent developments in multiobjective optimization
• Localization of minimax points
• A numerical approach for solving some convex maximization problems
• Piecewise convex formulations of binary and permutation problems
• A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
• Piecewise-convex maximization problems.

This page was built for publication: Attractive force search algorithm for piecewise convex maximization problems