A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications

DOI10.1007/BF01952475zbMath0659.90072OpenAlexW2081674331MaRDI QIDQ1112727

Tran Vu Thieu

Publication date: 1988

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01952475

zbMATH Keywords

concave minimizationlinear complementaritybilinear programmingglobal minimizationconcave functionouter approximation algorithmpolyhedral convex set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Decomposition methods (49M27)

Cites Work

• An outer approximation method for globally minimizing a concave function over a compact convex set
• Relationship between bilinear programming and concave minimization under linear constraints
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• Concave minimization under linear constraints with special structure
• Convergent Algorithms for Minimizing a Concave Function
• Convex Analysis

This page was built for publication: A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications