A finite algorithm for concave minimization over a polyhedron
From MaRDI portal
Recommendations
- An algorithm for concave integer minimization over a polyhedron
- An algorithm and new penalties for concave integer minimization over a polyhedron
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- A simple finite cone covering algorithm for concave minimization
- Finite algorithm for minimizing the product of two linear functions over a polyhedron
- Minimizing Piecewise-Concave Functions Over Polyhedra
- A Descent Algorithm for Minimizing Polyhedral Convex Functions
- scientific article; zbMATH DE number 4187464
- scientific article; zbMATH DE number 1795726
- An optimal algorithm for computing a minimum nested nonconvex polygon
Cited in
(45)- An algorithm for optimizing over the weakly-efficient set
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- A finite algorithm for globally minimizing a concave function under linear constraints and its applications
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
- On the structure and properties of a linear multilevel programming problem
- A note on the solution of bilinear programming problems by reduction to concave minimization
- Normal conical algorithm for concave minimization over polytopes
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- 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
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
- A general algorithm for determining all essential solutions and inequalities for any convex polyhedron
- Discontinuous piecewise linear optimization
- A finite algorithm for global minimization of separable concave programs
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- Nonconvex optimization over a polytope using generalized capacity improvement
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Solving polyhedral d.c. optimization problems via concave minimization
- A note on adapting methods for continuous global optimization to the discrete case
- Separable concave minimization via partial outer approximation and branch and bound
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- An algorithm for concave integer minimization over a polyhedron
- scientific article; zbMATH DE number 4135726 (Why is no real title available?)
- Concave Minimization Via Collapsing Polytopes
- scientific article; zbMATH DE number 4108510 (Why is no real title available?)
- scientific article; zbMATH DE number 4127006 (Why is no real title available?)
- An algorithm and new penalties for concave integer minimization over a polyhedron
- scientific article; zbMATH DE number 1051323 (Why is no real title available?)
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Finite algorithms for global minimization of separable concave programs
- scientific article; zbMATH DE number 970339 (Why is no real title available?)
- scientific article; zbMATH DE number 970356 (Why is no real title available?)
- scientific article; zbMATH DE number 2208557 (Why is no real title available?)
- scientific article; zbMATH DE number 4187464 (Why is no real title available?)
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- A simple finite cone covering algorithm for concave minimization
- Reverse polyblock approximation for optimization over the weakly efficient set and efficient set.
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- A general purpose exact solution method for mixed integer concave minimization problems
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- Non-convex optimization problems with linear KKT subsystem
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- A simplicial algorithm for concave minimization and its performance as a heuristic tool
This page was built for publication: A finite algorithm for concave minimization over a polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705227)
