A class of exhaustive cone splitting procedures in conical algorithms for concave minmization

DOI10.1080/02331938708843294zbMath0637.90074OpenAlexW2011693469MaRDI QIDQ3778553

S. L. Utkin, Hoang Tuy, V. Khatchaturov

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843294

zbMATH Keywords

concave minimizationconical algorithmsexhaustive cone splitting procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

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, Constraint decomposition algorithms in global optimization, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, A branch-and-reduce approach to global optimization, On geometry and convergence of a class of simplicial covers, Normal conical algorithm for concave minimization over polytopes, Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, A branch and bound-outer approximation algorithm for concave minimization over a convex set, Concave minimization via conical partitions and polyhedral outer approximation, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems

Cites Work

• Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• Convergent Algorithms for Minimizing a Concave Function