Accelerating method of global optimization for signomial geometric programming
DOI10.1016/j.cam.2007.01.039zbMath1140.65048OpenAlexW1971571344MaRDI QIDQ2479370
Xiaoai Li, Pei-Ping Shen, Hong-Wei Jiao
Publication date: 26 March 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.01.039
algorithmglobal optimizationconvergence accelerationnumerical experimentsbranch and boundcomputational efficiencysignomial geometric programmingdeleting technique
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items (7)
Cites Work
- Unnamed Item
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Prediction of oligopeptide conformations via deterministic global optimization
- Global optimization of signomial geometric programming using linear relaxation.
- A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
- The expansion of functions under transformation and its application to optimization
- Introduction to global optimization.
This page was built for publication: Accelerating method of global optimization for signomial geometric programming