Pages that link to "Item:Q1176848"
From MaRDI portal
The following pages link to Method for minimizing a convex-concave function over a convex set (Q1176848):
Displaying 11 items.
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions (Q1804585) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- Integral global minimization: Algorithms, implementations and numerical tests (Q1913610) (← links)
- A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models (Q2798106) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
