Separable concave minimization via partial outer approximation and branch and bound
From MaRDI portal
Publication:2277369
DOI10.1016/0167-6377(90)90059-EzbMath0725.90084OpenAlexW2047773517MaRDI QIDQ2277369
Publication date: 1990
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(90)90059-e
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (12)
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ Computational comparison of two methods for constrained global optimization ⋮ Capacity planning in networks of queues with manufacturing applications ⋮ New formulations of the multiple sequence alignment problem ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ A new simplicial cover technique in constrained global optimization ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ A note on adapting methods for continuous global optimization to the discrete case ⋮ Separable concave minimization via partial outer approximation and branch and bound ⋮ Nonlinear programming for multiperiod capacity planning in a manufacturing system ⋮ Sufficient optimality criterion for linearly constrained, separable concave minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- On the global minimization of concave functions
- Concave minimization via conical partitions and polyhedral outer approximation
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- On the structure and properties of a linear multilevel programming problem
- Constrained global optimization: algorithms and applications
- Outer approximation by polyhedral convex sets
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Relationship between bilinear programming and concave minimization under linear constraints
- Quasi-concave minimization subject to linear constraints
- Separable concave minimization via partial outer approximation and branch and bound
- Jointly Constrained Biconvex Programming
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A finite algorithm for concave minimization over a polyhedron
- Methods for Global Concave Minimization: A Bibliographic Survey
- Concave Minimization Via Collapsing Polytopes
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A method for globally minimizing concave functions over convex sets
- Convergent Algorithms for Minimizing a Concave Function
- Global Minimization in Nonconvex All-Quadratic Programming
- Global Maximization of a Convex Function with Linear Inequality Constraints
- An algorithm for nonconvex programming problems
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- A cutting plane algorithm for solving bilinear programs
- A Successive Underestimation Method for Concave Minimization Problems
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- Concave minimization over a convex polyhedron
- An Algorithm for Separable Nonconvex Programming Problems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
This page was built for publication: Separable concave minimization via partial outer approximation and branch and bound
