A nonconvex, piecewise linear optimization problem

DOI10.1016/0898-1221(91)90162-WzbMATH Open0719.90060OpenAlexW2004791296MaRDI QIDQ2640447FDOQ2640447

Authors: Bahia Benchekroun, James E. Falk 

Publication date: 1991

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90162-w

Recommendations

• Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
• Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
• A geometric approach to global optimization
• An efficient algorithm for minimizing a multivariate polyhedral function along a line
• Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming

zbMATH Keywords

branch and boundlinear interpolationDelaunay Decomposition

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Two algorithms for constructing a Delaunay triangulation
• Title not available (Why is that?)

Cited In (10)

• Piecewise linear methods for nonlinear equations and optimization
• Piecewise-convex maximization problems.
• Enumerating Delaunay partitions and global optimization
• Linear-programming approach to nonconvex variational problems
• An algorithm for piece-wise indefinite quadratic programming problem
• Linearly constrained global optimization via piecewise-linear approximation
• Optimistic optimization for continuous nonconvex piecewise affine functions
• A geometric approach to global optimization
• Global minimization via piecewise-linear underestimation
• The MIN PFS problem and piecewise linear model estimation

This page was built for publication: A nonconvex, piecewise linear optimization problem

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