scientific article; zbMATH DE number 1131980

zbMATH Open0925.65113MaRDI QIDQ4382879FDOQ4382879

Authors: Boting Yang, Kecun Zhang 

Publication date: 10 December 1998

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4867545
• A global convergent algorithm for mixed constrained signomial geometric programming
• scientific article; zbMATH DE number 5169224
• Global optimization of signomial geometric programming problems
• A global optimization algorithm for signomial geometric programming problem

zbMATH Keywords

global convergencesignomial geometric programminglocal quadratic convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited In (11)

• Title not available (Why is that?)
• A decomposition method for signomial geometric programming with nonnegative degree of difficulty
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
• A global convergent algorithm for mixed constrained signomial geometric programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Un nuevo algoritmo en programacion signomial
• Title not available (Why is that?)
• MM algorithms for geometric and signomial programming
• Accelerating method of global optimization for signomial geometric programming
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382879)