Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Constrained duality via unconstrained duality in generalized geometric programming

From MaRDI portal
Publication:1243232
Jump to:navigation, search

DOI10.1007/BF00933269zbMATH Open0369.90108OpenAlexW4251113971MaRDI QIDQ1243232FDOQ1243232


Authors: Elmor L. Peterson Edit this on Wikidata


Publication date: 1978

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933269





Mathematics Subject Classification ID

Nonlinear programming (90C30)


Cites Work

  • Geometric Programming


Cited In (4)

  • Symmetrized Separable Convex Programming
  • A geometric approach to nonsmooth optimization with sample applications
  • Minimum discrimination information problems via generalized geometric programming.
  • Fenchel's duality theorem in generalized geometric programming





This page was built for publication: Constrained duality via unconstrained duality in generalized geometric programming

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1243232&oldid=13327495"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 08:20. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki