Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Constrained duality via unconstrained duality in generalized geometric programming

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

DOI10.1007/BF00933269zbMath0369.90108OpenAlexW4251113971MaRDI QIDQ1243232

Elmor L. Peterson

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)


Related Items (4)

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



Cites Work

  • Geometric Programming


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

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