Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints

DOI10.1007/BF01442106zbMath0452.90060MaRDI QIDQ1148807

Stephen E. Jacobsen

Publication date: 1981

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

concave minimizationconvergencelinear inequality constraintsnonconvex programmingconvex polytopesTuy's cone splitting algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)

Related Items

Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, A class of exhaustive cone splitting procedures in conical algorithms for concave minmization, Normal conical algorithm for concave minimization over polytopes, Minimization of a quasi-concave function over an efficient set, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, On the global minimization of concave functions

Cites Work

• Global Maximization of a Convex Function with Linear Inequality Constraints
• A Successive Underestimation Method for Concave Minimization Problems
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms