Concave minimization via conical partitions and polyhedral outer approximation

DOI10.1007/BF01594938zbMath0734.90092MaRDI QIDQ811411

Harold P. Benson, Reiner Horst, Nguyen Van Thoai

Publication date: 1991

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

zbMATH Keywords

concave minimizationconvergencebranch-and-boundcutting planes

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 (28)

Variations and extension of the convex-concave procedure ⋮ Deterministic methods in constrained global optimization: Some recent advances and new fields of application ⋮ A finite concave minimization algorithm using branch and bound and neighbor generation ⋮ A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ Constraint decomposition algorithms in global optimization ⋮ On the construction of test problems for concave minimization algorithms ⋮ A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ Capacity planning in networks of queues with manufacturing applications ⋮ Set variational inequalities ⋮ Decomposition approach for the global minimization of biconcave functions over polytopes ⋮ Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets ⋮ On geometry and convergence of a class of simplicial covers ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ DC programming: overview. ⋮ An all-linear programming relaxation algorithm for optimizing over the efficient set ⋮ An analytical approach to global optimization ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ A new simplicial cover technique in constrained global optimization ⋮ On nonconvex optimization problems with separated nonconvex variables ⋮ Calculation of bounds on variables satisfying nonlinear inequality constraints ⋮ A note on adapting methods for continuous global optimization to the discrete case ⋮ Separable concave minimization via partial outer approximation and branch and bound ⋮ Difference of convex solution of quadratically constrained optimization problems. ⋮ Maximizing a concave function over the efficient or weakly-efficient set ⋮ Solution of a non-linear programming problem with quadratic functions ⋮ An algorithm for concave integer minimization over a polyhedron ⋮ Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• On the global minimization of concave functions
• An outer approximation method for globally minimizing a concave function over a compact convex set
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• On the convergence of global methods in multiextremal optimization
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
• Constrained global optimization: algorithms and applications
• On consistency of bounding operations in deterministic global optimization
• Outer approximation by polyhedral convex sets
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application
• 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
• On an outer approximation concept in global optimization
• A note on the convergence of an algorithm for nonconvex programming problems
• A method for globally minimizing concave functions over convex sets
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems

This page was built for publication: Concave minimization via conical partitions and polyhedral outer approximation