Attractive force search algorithm for piecewise convex maximization problems
From MaRDI portal
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
- scientific article; zbMATH DE number 5707333 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- scientific article; zbMATH DE number 2210595 (Why is no real title available?)
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- A numerical approach for solving some convex maximization problems
- A survey of recent developments in multiobjective optimization
- Handbook of test problems in local and global optimization
- Introduction to global optimization
- Localization of minimax points
- Multicriteria optimization
- On the local convergence of adjoint Broyden methods
- Piece adding technique for convex maximization problems
- Piecewise convex formulations of binary and permutation problems
- Piecewise convex maximization problems: Piece adding technique
- Piecewise-convex maximization problems.
- Piecewise-convex maximization problems: algorithm and computational experiments
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)
