Concave minimization via conical partitions and polyhedral outer approximation
From MaRDI portal
The paper deals with a so-called concave minimization problem, i.e. with minimizing a concave function over a convex compact set in \(R^ n\). An algorithm is introduced, which combines branch-and-bound elements with cutting planes. A convergence theorem is proved. Preliminary computer implementations and performance comparisons with earlier methods are reported.
Recommendations
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Normal conical algorithm for concave minimization over polytopes
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Subdivision of simplices relative to a cutting plane and finite concave minimization
Cites work
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A method for globally minimizing concave functions over convex sets
- A note on the convergence of an algorithm for nonconvex programming problems
- An algorithm for nonconvex programming problems
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Constrained global optimization: algorithms and applications
- Convergent Algorithms for Minimizing a Concave Function
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- Methods for Global Concave Minimization: A Bibliographic Survey
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On an outer approximation concept in global optimization
- On consistency of bounding operations in deterministic global optimization
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On the convergence of global methods in multiextremal optimization
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- On the global minimization of concave functions
- Outer approximation by polyhedral convex sets
Cited in
(61)- On outer approximation methods for solving concave minimization problems
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Normal conical algorithm for concave minimization over polytopes
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- On the minimization of a quasi-concave function subject to linear constraints
- 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 simplified convergence proof for the cone partitioning algorithm
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- 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
- Set variational inequalities
- Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems
- Difference of convex solution of quadratically constrained optimization problems.
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- Maximizing a concave function over the efficient or weakly-efficient set
- An algebra-based approach for linearly constrained concave minimization
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- Capacity planning in networks of queues with manufacturing applications
- Decomposition approach for the global minimization of biconcave functions over polytopes
- DC programming: overview.
- A convergent conical algorithm with -bisection for concave minimization
- A cone restriction estimate using polynomial partitioning
- A note on adapting methods for continuous global optimization to the discrete case
- Separable concave minimization via partial outer approximation and branch and bound
- Variations and extension of the convex-concave procedure
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- scientific article; zbMATH DE number 433001 (Why is no real title available?)
- An algorithm for concave integer minimization over a polyhedron
- scientific article; zbMATH DE number 4135726 (Why is no real title available?)
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Concave minimization under linear constraints with special structure
- Concave Minimization Via Collapsing Polytopes
- Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
- An algorithm and new penalties for concave integer minimization over a polyhedron
- On geometry and convergence of a class of simplicial covers
- scientific article; zbMATH DE number 1084001 (Why is no real title available?)
- scientific article; zbMATH DE number 1795726 (Why is no real title available?)
- scientific article; zbMATH DE number 1795202 (Why is no real title available?)
- Deterministic algorithms for constrained concave minimization: A unified critical survey
- Solution of a non-linear programming problem with quadratic functions
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- Cutting Planes for Low-Rank-Like Concave Minimization Problems
- scientific article; zbMATH DE number 4187464 (Why is no real title available?)
- A simple finite cone covering algorithm for concave minimization
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- Finitely convergent cutting planes for concave minimization
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- A truncated -subdifferential method for global DC optimization
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Global minimization of a concave function subject to mixed linear and reverse convex constraints
This page was built for publication: Concave minimization via conical partitions and polyhedral outer approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811411)
