A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming

DOI10.1016/S0895-7177(02)00080-8zbMath1176.90474OpenAlexW2083501069MaRDI QIDQ1876779

Ke-Cun Zhang, Yan-Jun Wang, Pei-Ping Shen

Publication date: 20 August 2004

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(02)00080-8

zbMATH Keywords

Trust regionGeneralized geometric programmingCondensation curvilinear path

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items

The model and algorithm for the optimization of the granularity distribution, The approximation algorithm for solving a sort of non-smooth programming, A new global optimization algorithm for solving generalized geometric programming, MM algorithms for geometric and signomial programming, Accelerating method of global optimization for signomial geometric programming, The generalized Julia set perturbed by composing additive and multiplicative noises

Cites Work

• Unnamed Item
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
• Two new unconstrained optimization algorithms which use function and gradient values
• The expansion of functions under transformation and its application to optimization
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
• Generalized Polynomial Optimization
• Generalized Weighted Mean Programming