1970
DOI: 10.1115/1.3427707
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Design by Geometric Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

1986
1986
2019
2019

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(26 citation statements)
references
References 0 publications
0
26
0
Order By: Relevance
“…Following [11], [14], an iterative procedure can be used where at each iteration the standard GP (21)- (23) is solved for an updated set of {γ k }. Assuming a feasible set of magnitude…”
Section: B Amplitude Optimizationmentioning
confidence: 99%
“…Following [11], [14], an iterative procedure can be used where at each iteration the standard GP (21)- (23) is solved for an updated set of {γ k }. Assuming a feasible set of magnitude…”
Section: B Amplitude Optimizationmentioning
confidence: 99%
“…Geometric programming is one particular form of convex optimization, which traditionally has been used for engineering design [5,1], and more recently also for analog circuit sizing [9].…”
Section: Introductionmentioning
confidence: 99%
“…Geometric programming problems with posynomials are known to have a unique, globally optimal solution [18]. The example in this section has a quadratic object, 14 variables, 6 inequality constraints, and 4 equality constraints, along with non negativity constraints on the variables, as shown in Equation 14.…”
Section: A Geometric Programming Problemmentioning
confidence: 99%