A new accelerating method for globally solving a class of nonconvex programming problems
From MaRDI portal
Publication:923946
DOI10.1016/j.na.2009.01.142zbMath1168.90576OpenAlexW2090518645MaRDI QIDQ923946
Xiaodi Bai, Weimin Li, Pei-Ping Shen
Publication date: 24 July 2009
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.01.142
Related Items (8)
A new linearization method for generalized linear multiplicative programming ⋮ A branch-and-reduce approach for solving generalized linear multiplicative programming ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ Using conical partition to globally maximizing the nonlinear sum of ratios ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ A deterministic method for solving the sum of linear ratios problem ⋮ Global optimization algorithm for a generalized linear multiplicative programming
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- Linearization method for a class of multiplicative programming with exponent
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Prediction of oligopeptide conformations via deterministic global optimization
- Solving long-term financial planning problems via global optimization
- Global optimization of multiplicative programs
- A unified monotonic approach to generalized linear fractional programming
- Finite algorithm for generalized linear multiplicative programming
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A deterministic global optimization algorithm for generalized geometric programming
- Robust Optimization of Large-Scale Systems
- Convex analysis and global optimization
This page was built for publication: A new accelerating method for globally solving a class of nonconvex programming problems
