Pages that link to "Item:Q5322147"
From MaRDI portal
The following pages link to Digital Circuit Optimization via Geometric Programming (Q5322147):
Displayed 33 items.
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- Geometric programming approach to doping profile design optimization of metal-oxide-semiconductor devices (Q462766) (← links)
- Path following in the exact penalty method of convex programming (Q493687) (← links)
- Relative entropy optimization and its applications (Q507310) (← links)
- Robust resource allocations in temporal networks (Q715076) (← links)
- Estimating cell probabilities in contingency tables with constraints on marginals/conditionals by geometric programming with applications (Q736994) (← links)
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
- Tractable approximate robust geometric programming (Q833439) (← links)
- Sparse identification of posynomial models (Q894327) (← links)
- A tutorial on geometric programming (Q1027158) (← links)
- Multi-objective geometric programming problem with \(\epsilon\)-constraint method (Q1991380) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- A convex programming solution for gate-sizing with pipelining constraints (Q2147929) (← links)
- Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms (Q2164609) (← links)
- Copula theory approach to stochastic geometric programming (Q2231327) (← links)
- Disciplined geometric programming (Q2311189) (← links)
- Derivative-free robust optimization for circuit design (Q2342134) (← links)
- Variation-aware clock network buffer sizing using robust multi-objective optimization (Q2358032) (← links)
- Data fitting with geometric-programming-compatible softmax functions (Q2358087) (← links)
- An efficient convexification method for solving generalized geometric problems (Q2358874) (← links)
- Robust and reliable portfolio optimization formulation of a chance constrained problem (Q2360112) (← links)
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
- Joint optimisation of price, warranty and recovery planning in remanufacturing of used products under linear and non-linear demand, return and cost functions (Q2798443) (← links)
- Relative Entropy Relaxations for Signomial Optimization (Q2805708) (← links)
- Solving a posynomial geometric programming problem with fully fuzzy approach (Q3388431) (← links)
- On the Fuzzy Fractional Posynomial Geometric Programming Problems (Q4977928) (← links)
- Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)
- (Q5154521) (← links)
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems (Q5740224) (← links)
- A method of sequential log-convex programming for engineering design (Q6050371) (← links)
- Robust chance-constrained geometric programming with application to demand risk mitigation (Q6161554) (← links)
- Hyperloop system optimization (Q6173780) (← links)
- Quantum theory in finite dimension cannot explain every general process with finite memory (Q6202449) (← links)