Attractive force search algorithm for piecewise convex maximization problems
From MaRDI portal
Publication:694170
DOI10.1007/S11590-011-0395-YzbMATH Open1259.90100OpenAlexW2043163275MaRDI QIDQ694170FDOQ694170
Authors: Dominique Fortin, Ider Tseveendorj 
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
Recommendations
- Global maximization of special classes of convex functions on a convex polyhedral set
- Piecewise-convex maximization problems: algorithm and computational experiments
- Survey of piecewise convex maximization and PCMP over spherical sets
- Piecewise-convex maximization problems.
- Piecewise convex formulations of binary and permutation problems
Cites Work
- Multicriteria optimization
- Title not available (Why is that?)
- A survey of recent developments in multiobjective optimization
- Piecewise-convex maximization problems.
- Handbook of test problems in local and global optimization
- Introduction to global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- On the local convergence of adjoint Broyden methods
- Piecewise-convex maximization problems: algorithm and computational experiments
- Piecewise convex maximization problems: Piece adding technique
- A numerical approach for solving some convex maximization problems
- Piece adding technique for convex maximization problems
- Localization of minimax points
- Title not available (Why is that?)
- Piecewise convex formulations of binary and permutation problems
Cited In (2)
This page was built for publication: Attractive force search algorithm for piecewise convex maximization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694170)
