The hill detouring method for minimizing hinging hyperplanes functions
From MaRDI portal
Publication:1762167
DOI10.1016/j.cor.2011.10.017zbMath1251.90306MaRDI QIDQ1762167
Jun Xu, Shuning Wang, Xiaomu Mu, Xiao Lin Huang
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.017
concave minimization; d.c. programming; hinging hyperplanes; global optimum; continuous piecewise linear
90C26: Nonconvex programming, global optimization
Uses Software
Cites Work
- Unnamed Item
- Some new Farkas-type results for inequality systems with DC functions
- Efficient heuristics for inventory placement in acyclic networks
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- On solving a d.c. programming problem by a sequence of linear programs
- Discontinuous piecewise linear optimization
- An optimal bound for d. c. programs with convex constraints
- Models for representing piecewise linear cost functions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming: overview.
- Absolute value equation solution via concave minimization
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Generalization of Hinging Hyperplanes
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
- Hinging hyperplanes for regression, classification, and function approximation
- On the hinge-finding algorithm for hingeing hyperplanes
- High-level canonical piecewise linear representation using a simplicial partition
- Cutting Planes for Low-Rank-Like Concave Minimization Problems
- Polyhedral mixture of linear experts for many-to-one mapping inversion and multiple controllers
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
