The hill detouring method for minimizing hinging hyperplanes functions

DOI10.1016/J.COR.2011.10.017MaRDI QIDQ1762167zbMATH OpenOpenAlexFDO

Authors Jun Xu, Xiaomu Mu, Shuning Wang, Xiaolin 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

zbMATH Keywords

global optimumconcave minimizationd.c. programmingcontinuous piecewise linearhinging hyperplanes

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• The Hill determinant method revisited
• On the hinge-finding algorithm for hingeing hyperplanes
• Hill tunneling method via peak subpoints for continuous piecewise linear programming
• Hinging hyperplanes for regression, classification, and function approximation
• High-order normalizations in the Hill problem
• Hyperbolic smoothing function method for minimax problems
• A Descent Algorithm for Minimizing Polyhedral Convex Functions
• Algorithms for approximating minimization problems in Hilbert spaces
• \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
• scientific article; zbMATH DE number 3920202

Cites work

• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• Absolute value equation solution via concave minimization
• An optimal bound for d. c. programs with convex constraints
• Cutting Planes for Low-Rank-Like Concave Minimization Problems
• DC programming: overview.
• Discontinuous piecewise linear optimization
• Efficient heuristics for inventory placement in acyclic networks
• Generalization of Hinging Hyperplanes
• High-level canonical piecewise linear representation using a simplicial partition
• Hinging hyperplanes for regression, classification, and function approximation
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Models for representing piecewise linear cost functions
• On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
• On solving a d.c. programming problem by a sequence of linear programs
• On the hinge-finding algorithm for hingeing hyperplanes
• Polyhedral mixture of linear experts for many-to-one mapping inversion and multiple controllers
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• Some new Farkas-type results for inequality systems with DC functions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

Cited in

(4)

• On finding global optima for the hinge fitting problem.
• A polynomial local optimality condition for the concave piecewise linear network flow problem
• High-order normalizations in the Hill problem
• Hill tunneling method via peak subpoints for continuous piecewise linear programming

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: The hill detouring method for minimizing hinging hyperplanes functions

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