An efficient algorithm for computing a class of multiplicative optimization problem
From MaRDI portal
Publication:5069808
Recommendations
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization algorithm for a generalized linear multiplicative programming
- Global algorithm for solving linear multiplicative programming problems
- An efficient algorithm for globally solving generalized linear multiplicative programming
Cites work
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A finite branch-and-bound algorithm for linear multiplicative programming
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A practicable branch and bound algorithm for sum of linear ratios problem
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Finite algorithm for generalized linear multiplicative programming
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Global optimization of multiplicative programs
- Global optimization of nonlinear sum of ratios problem
- Heuristic methods for linear multiplicative programming
- scientific article; zbMATH DE number 3200974 (Why is no real title available?)
- Linearization method for a class of multiplicative programming with exponent
- On certain integrals of Lipschitz-Hankel type involving products of bessel functions
- Optimization on low rank nonconvex structures
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Robust Optimization of Large-Scale Systems
Cited in
(6)- Multiplicative programming problems: Analysis and efficient point search heuristic
- Range division and contraction algorithm for a class of global optimization problems
- scientific article; zbMATH DE number 3843505 (Why is no real title available?)
- scientific article; zbMATH DE number 3908183 (Why is no real title available?)
- scientific article; zbMATH DE number 4053362 (Why is no real title available?)
- Some results on OMP algorithm for MMV problem
This page was built for publication: An efficient algorithm for computing a class of multiplicative optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069808)
