Piecewise-convex maximization problems.

DOI10.1023/A:1017979506314MaRDI QIDQ5959052zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Piecewise-convex maximization problems: algorithm and computational experiments
• Piecewise convex maximization problems: Piece adding technique
• A nonconvex, piecewise linear optimization problem
• scientific article; zbMATH DE number 1560354
• scientific article; zbMATH DE number 2107836
• Generalized pseudo-convex minmax programming.
• scientific article; zbMATH DE number 2153021
• Piece adding technique for convex maximization problems
• Piecewise convex-concave approximation in the minimax norm
• Maximization problems and Lindenstrauss condition

Cited in

(20)

• Optimality conditions in global optimization and their applications
• Piecewise-convex maximization problems: algorithm and computational experiments
• Piecewise convexity of artificial neural networks
• Robinsonian matrices: recognition challenges
• A note on maxmin problem
• On the maximization of (not necessarily) convex functions on convex sets
• Survey of piecewise convex maximization and PCMP over spherical sets
• On the convexity of piecewise-defined functions
• Piecewise convex maximization approach to multiknapsack
• Feasibility in reverse convex mixed-integer programming
• scientific article; zbMATH DE number 1560354 (Why is no real title available?)
• Minimizing Piecewise-Concave Functions Over Polyhedra
• Piecewise convex maximization problems: Piece adding technique
• Piecewise convex formulations of binary and permutation problems
• Linear-time convexity test for low-order piecewise polynomials
• Piece adding technique for convex maximization problems
• Covering balls and \(\mathcal{HT}\)-\textit{differential} for convex maximization
• Attractive force search algorithm for piecewise convex maximization problems
• Recent advances in minimax problem and bimatrix games
• Reverse convex problems: an approach based on optimality conditions

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

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