A branch and bound-outer approximation algorithm for concave minimization over a convex set
From MaRDI portal
DOI10.1016/0898-1221(91)90161-VzbMATH Open0722.90055MaRDI QIDQ757243FDOQ757243
Harold P. Benson, Reiner Horst
Publication date: 1991
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Methods for Global Concave Minimization: A Bibliographic Survey
- Convergent Algorithms for Minimizing a Concave Function
- An algorithm for nonconvex programming problems
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A Successive Underestimation Method for Concave Minimization Problems
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A method for globally minimizing concave functions over convex sets
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- Minimizing a concave function over a compact convex set
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Outer approximation by polyhedral convex sets
- Relationship between bilinear programming and concave minimization under linear constraints
- A finite algorithm for concave minimization over a polyhedron
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
Cited In (25)
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Title not available (Why is that?)
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Capacity planning in networks of queues with manufacturing applications
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
- On solving a d.c. programming problem by a sequence of linear programs
- A new algorithm for minimizing convex functions over convex sets
- A norm minimization-based convex vector optimization algorithm
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- On geometry and convergence of a class of simplicial covers
- Robust bilevel optimization for near-optimal lower-level solutions
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A new simplicial cover technique in constrained global optimization
- On nonconvex optimization problems with separated nonconvex variables
- Title not available (Why is that?)
- An outcome space algorithm for minimizing the product of two convex functions over a convex set
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- Title not available (Why is that?)
- Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- An outer approximation method for globally minimizing a concave function over a compact convex set
- A finite concave minimization algorithm using branch and bound and neighbor generation
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
Recommendations
- Concave minimization via conical partitions and polyhedral outer approximation 👍 👎
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set 👍 👎
- A finite algorithm for concave minimization over a polyhedron 👍 👎
- On outer approximation methods for solving concave minimization problems 👍 👎
- On the global minimization of concave functions 👍 👎
This page was built for publication: A branch and bound-outer approximation algorithm for concave minimization over a convex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757243)
