Decomposition approach for the global minimization of biconcave functions over polytopes
From MaRDI portal
Recommendations
- Concave minimization via conical partitions and polyhedral outer approximation
- A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- A finite algorithm for concave minimization over a polyhedron
- Concave minimization under linear constraints with special structure
Cites work
- A global optimization approach for solving the convex multiplicative programming problem
- A new algorithm for solving the general quadratic programming problem
- An algorithm for nonconvex programming problems
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Concave minimization under linear constraints with special structure
- Concave minimization via conical partitions and polyhedral outer approximation
- Constraint decomposition algorithms in global optimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Convergent Algorithms for Minimizing a Concave Function
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On the convergence of global methods in multiextremal optimization
- On-line and off-line vertex enumeration by adjacency lists
Cited in
(10)- Lagrange duality and partitioning techniques in nonconvex global optimization
- Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Continuous relaxation for discrete DC programming
- Global optimization for the sum of concave-convex ratios problem
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- On the global optimization of sums of linear fractional functions over a convex set
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
This page was built for publication: Decomposition approach for the global minimization of biconcave functions over polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918288)
