Symmetric Duality for Generalized Unconstrained Geometric Programming

DOI10.1137/0119049zbMath0205.48001OpenAlexW2062393121MaRDI QIDQ5605598

Elmor L. Peterson

Publication date: 1970

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0119049

Mathematics Subject Classification ID

Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Related Items (16)

Approximating term structure of interest rates using cubic \(L_1\) splines ⋮ An unconstrained convex programming view of linear programming ⋮ Convex analysis treated by linear programming ⋮ A geometric programming approach for bivariate cubic \(L_{1}\) splines ⋮ Shape-preserving properties of univariate cubic \(L_{1}\) splines ⋮ The complementary unboundedness of dual feasible solution sets in convex programming ⋮ A geometric programming framework for univariate cubic \(L_1\) smoothing splines ⋮ On a classification scheme for geometric programming and complementarity theorems†^† ⋮ Fenchel's duality theorem in generalized geometric programming ⋮ Projection and restriction methods in geometric programming and related problems ⋮ Trace optimization problems and generalized geometric programming ⋮ A generalisation of geometric programming with an application to information theory ⋮ Convex stochastic programmes with simple recourse ⋮ Geometric programming with signomials ⋮ Classifying convex extremum problems over linear topologies having separation properties ⋮ Efficiency and proper efficiency in vector maximization with respect to cones

This page was built for publication: Symmetric Duality for Generalized Unconstrained Geometric Programming