Finite method of minimizing a concave function under linear constraints and applications
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4053360
- A finite algorithm for globally minimizing a concave function under linear constraints and its applications
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
- A note on the solution of bilinear programming problems by reduction to concave minimization
- A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications
Cites work
Cited in
(12)- A finite algorithm for globally minimizing a concave function under linear constraints and its applications
- A note on the solution of bilinear programming problems by reduction to concave minimization
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
- Linearly constrained global minimization of functions with concave minorants
- scientific article; zbMATH DE number 3850835 (Why is no real title available?)
- scientific article; zbMATH DE number 3856836 (Why is no real title available?)
- scientific article; zbMATH DE number 4053360 (Why is no real title available?)
- scientific article; zbMATH DE number 4070673 (Why is no real title available?)
- scientific article; zbMATH DE number 79269 (Why is no real title available?)
- A FAST conic method for function minimization
- scientific article; zbMATH DE number 1461874 (Why is no real title available?)
- Finite convergence of an active signature method to local minima of piecewise linear functions
This page was built for publication: Finite method of minimizing a concave function under linear constraints and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030588)