Normal conical algorithm for concave minimization over polytopes

DOI10.1007/BF01586935zbMath0743.90103OpenAlexW2080176670MaRDI QIDQ1177231

Hoang Tuy

Publication date: 26 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

conical algorithmsbisectionconvergence conditionconcave minimization over polytopesnormal subdivision process

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm, An algorithm for maximizing a convex function over a simple set, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, On the exhaustivity of simplicial partitioning, Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, The complementary convex structure in global optimization, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Outer approximation algorithms for canonical DC problems, A convergent conical algorithm with \(\omega \)-bisection for concave minimization, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, A quasiconcave minimization method for solving linear two-level programs, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems

Cites Work

• Unnamed Item
• On the global minimization of concave functions
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• 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
• Methods for Global Concave Minimization: A Bibliographic Survey
• A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• Convergent Algorithms for Minimizing a Concave Function
• Global Maximization of a Convex Function with Linear Inequality Constraints
• An algorithm for nonconvex programming problems
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms