Piecewise-convex maximization problems.

DOI10.1023/A:1017979506314zbMath1099.90591OpenAlexW1604986578MaRDI QIDQ5959052

Ider Tseveendorj

Publication date: 2001

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

Full work available at URL: https://doi.org/10.1023/a:1017979506314

zbMATH Keywords

Global optimizationNonconvex and nonsmooth problemPiecewise convex functionSufficient and necessary optimality conditions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46)

Related Items (15)

Generalized subdifferentials of the sign change counting function ⋮ Reverse convex problems: an approach based on optimality conditions ⋮ Robinsonian matrices: recognition challenges ⋮ Piece adding technique for convex maximization problems ⋮ A note on maxmin problem ⋮ Covering balls and \(\mathcal{HT}\)-\textit{differential} for convex maximization ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ On the maximization of (not necessarily) convex functions on convex sets ⋮ Feasibility in reverse convex mixed-integer programming ⋮ Attractive force search algorithm for piecewise convex maximization problems ⋮ Piecewise convex maximization problems: Piece adding technique ⋮ Piecewise convexity of artificial neural networks ⋮ Optimality conditions in global optimization and their applications ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Piecewise convex maximization approach to multiknapsack

This page was built for publication: Piecewise-convex maximization problems.