A branch-and-bound method for absolute value programs

DOI10.1080/02331934.2011.644289zbMath1288.90099OpenAlexW2070958529MaRDI QIDQ5413887

Shota Yamanaka, Masao Fukushima

Publication date: 2 May 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/196860

zbMATH Keywords

branch-and-bound methodabsolute value equationabsolute value programnonconvex facility location problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (7)

Unified smoothing functions for absolute value equation associated with second-order cone ⋮ Duality of nonconvex optimization with positively homogeneous functions ⋮ On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems ⋮ Numerical comparisons based on four smoothing functions for absolute value equation ⋮ Neural network based on systematically generated smoothing functions for absolute value equation ⋮ A smoothing Newton method for absolute value equation associated with second-order cone ⋮ Levenberg-Marquardt method for absolute value equation associated with second-order cone

Cites Work

• A generalized Newton method for absolute value equations associated with second order cones
• A globally and quadratically convergent method for absolute value equations
• On unique solvability of the absolute value equation
• Absolute value equations
• Absolute value programming
• A generalized Newton method for absolute value equations
• Global and finite convergence of a generalized Newton method for absolute value equations
• Absolute value equation solution via concave minimization
• Locating two obnoxious facilities using the weighted maximin criterion
• On equivalent reformulations for absolute value equations
• The single facility location problem with minimum distance constraints
• A theorem of the alternatives for the equationAx+B|x| =b
• Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance
• The multifacility maximin planar location problem with facility interaction

This page was built for publication: A branch-and-bound method for absolute value programs