Generalized Polynomial Optimization

Cited in

(38)

Convexity of products of univariate functions and convexification transformations for geometric programming
Composite geometric programming
Signomial dual Kuhn-Tucker intervals
Geometric programming. Method and applications
A computational study of methods for solving polynomial geometric programs
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
Duality of a nonconvex sum of ratios
Investigation of path-following algorithms for signomial geometric programming problems
Global optimization of signomial geometric programming using linear relaxation.
A global optimization algorithm for signomial geometric programming problem
Linearization method of global optimization for generalized geometric programming
Global optimization of generalized geometric programming
A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
Multi-parametric disaggregation technique for global optimization of polynomial programming problems
Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
A modified convace simplex algorithm for geometric programming
An efficient convexification method for solving generalized geometric problems
Branch-reduction-bound algorithm for generalized geometric programming
A global optimization using linear relaxation for generalized geometric programming
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
Geometric programming with signomials
A deterministic global optimization algorithm for generalized geometric programming
Non-standard posynomial geometric programs
A framework for globally optimizing mixed-integer signomial programs
An iterative convex simplex method for geometric programming with applications†
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
Duality for linear multiplicative programs
Efficient Convexification Strategy for Generalized Geometric Programming Problems
Penalty function versus non-penalty function methods for constrained nonlinear programming problems
On generalized geometric programming problems with non-positive variables
A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
Global solution of optimization problems with signomial parts
Impossibility of extending Pólya's theorem to ``forms with arbitrary real exponents

This page was built for publication: Generalized Polynomial Optimization

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