A branch and bound-outer approximation algorithm for concave minimization over a convex set

Convex programming (90C25) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

Cites work

Cited in

(34)

Performance of approximate algorithms for global minimization
A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
scientific article; zbMATH DE number 433001 (Why is no real title available?)
Convergence analysis of a norm minimization-based convex vector optimization algorithm
A new simplicial cover technique in constrained global optimization
On nonconvex optimization problems with separated nonconvex variables
A finite concave minimization algorithm using branch and bound and neighbor generation
A norm minimization-based convex vector optimization algorithm
On solving a d.c. programming problem by a sequence of linear programs
On geometry and convergence of a class of simplicial covers
A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
Computational methods for solving nonconvex block-separable constrained quadratic problems
An all-linear programming relaxation algorithm for optimizing over the efficient set
scientific article; zbMATH DE number 2190131 (Why is no real title available?)
Capacity planning in networks of queues with manufacturing applications
On outer approximation methods for solving concave minimization problems
An outer approximation method for globally minimizing a concave function over a compact convex set
Robust bilevel optimization for near-optimal lower-level solutions
An outcome space algorithm for minimizing the product of two convex functions over a convex set
On solving general reverse convex programming problems by a sequence of linear programs and line searches
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints
An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
Concave minimization via conical partitions and polyhedral outer approximation
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
On the global minimization of concave functions
A new algorithm for minimizing convex functions over convex sets
On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
Sufficient optimality criterion for linearly constrained, separable concave minimization problems
scientific article; zbMATH DE number 1861589 (Why is no real title available?)

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)