Generalized Polynomial Optimization
From MaRDI portal
Publication:5557613
DOI10.1137/0115117zbMath0171.18002OpenAlexW2013686786MaRDI QIDQ5557613
Publication date: 1967
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0115117
Related Items
An efficient convexification method for solving generalized geometric problems ⋮ A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming ⋮ On generalized geometric programming problems with non-positive variables ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms ⋮ Composite geometric programming ⋮ A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation ⋮ Signomial dual Kuhn-Tucker intervals ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Penalty function versus non-penalty function methods for constrained nonlinear programming problems ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ Non-standard posynomial geometric programs ⋮ Geometric programming. Method and applications ⋮ A global optimization using linear relaxation for generalized geometric programming ⋮ Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems ⋮ Global solution of optimization problems with signomial parts ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ Global optimization of signomial geometric programming using linear relaxation. ⋮ Efficient Convexification Strategy for Generalized Geometric Programming Problems ⋮ Impossibility of extending Pólya's theorem to ``forms with arbitrary real exponents ⋮ Linearization method of global optimization for generalized geometric programming ⋮ A modified convace simplex algorithm for geometric programming ⋮ A computational study of methods for solving polynomial geometric programs ⋮ Duality for linear multiplicative programs ⋮ An iterative convex simplex method for geometric programming with applications† ⋮ Global optimization of generalized geometric programming ⋮ Transcendental geometric programs ⋮ Interval arithmetic in unidimensional signomial programming ⋮ Current state of the art of algorithms and computer software for geometric programming ⋮ Flexible contracting. Theory and case examples ⋮ Convexity of products of univariate functions and convexification transformations for geometric programming ⋮ Duality of a nonconvex sum of ratios ⋮ Mass action and polynomial optimization ⋮ Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms ⋮ On the solution of maximization problems of optimal design by geometric programming ⋮ Investigation of path-following algorithms for signomial geometric programming problems ⋮ Geometric programming with signomials ⋮ A deterministic global optimization algorithm for generalized geometric programming
