Symmetric Duality for Generalized Unconstrained Geometric Programming

DOI10.1137/0119049MaRDI QIDQ5605598zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(16)

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

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

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