An efficient algorithm for computing a class of multiplicative optimization problem
From MaRDI portal
Publication:5069808
DOI10.1080/09720529.2016.1178926OpenAlexW2472320752MaRDI QIDQ5069808
Publication date: 19 April 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2016.1178926
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization algorithm for sum of generalized polynomial ratios problem
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Global optimization of nonlinear sum of ratios problem
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- Linearization method for a class of multiplicative programming with exponent
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- Optimization on low rank nonconvex structures
- Global optimization of multiplicative programs
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Finite algorithm for generalized linear multiplicative programming
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Robust Optimization of Large-Scale Systems
- On certain integrals of Lipschitz-Hankel type involving products of bessel functions
- A finite branch-and-bound algorithm for linear multiplicative programming
This page was built for publication: An efficient algorithm for computing a class of multiplicative optimization problem
