The hill detouring method for minimizing hinging hyperplanes functions
type: Item
instance of: scholarly article
title: The hill detouring method for minimizing hinging hyperplanes functions
zbMATH Open document ID: 1251.90306
author: Jun Xu
author: Xiaomu Mu
author: Shuning Wang
author: Xiaolin Huang
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6107606
zbMATH Keywords: hinging hyperplanes
zbMATH Keywords: continuous piecewise linear
zbMATH Keywords: global optimum
zbMATH Keywords: d.c. programming
zbMATH Keywords: concave minimization
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2011.10.017
OpenAlex ID: W2048207701
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Some new Farkas-type results for inequality systems with DC functions
cites work: Hinging hyperplanes for regression, classification, and function approximation
cites work: An optimal bound for d. c. programs with convex constraints
cites work: Discontinuous piecewise linear optimization
cites work: A simplex algorithm for piecewise-linear programming I: Derivation and proof
cites work: A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
cites work: A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
cites work: Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
cites work: Q4889854
cites work: On solving a d.c. programming problem by a sequence of linear programs
cites work: DC programming: overview.
cites work: High-level canonical piecewise linear representation using a simplicial partition
cites work: Polyhedral mixture of linear experts for many-to-one mapping inversion and multiple controllers
cites work: Models for representing piecewise linear cost functions
cites work: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
cites work: Absolute value equation solution via concave minimization
cites work: Cutting Planes for Low-Rank-Like Concave Minimization Problems
cites work: On the hinge-finding algorithm for hingeing hyperplanes
cites work: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
cites work: Efficient heuristics for inventory placement in acyclic networks
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
cites work: Generalization of Hinging Hyperplanes
DOI: 10.1016/J.COR.2011.10.017
Recommended article: The Hill determinant method revisited
Recommended article: On the hinge-finding algorithm for hingeing hyperplanes
Recommended article: Hill tunneling method via peak subpoints for continuous piecewise linear programming
Recommended article: Hinging hyperplanes for regression, classification, and function approximation
Recommended article: High-order normalizations in the Hill problem
Recommended article: Hyperbolic smoothing function method for minimax problems
Recommended article: A Descent Algorithm for Minimizing Polyhedral Convex Functions
Recommended article: Algorithms for approximating minimization problems in Hilbert spaces
Recommended article: \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
Recommended article: Q3694997
description: scientific article; zbMATH DE number 6107606