Pages that link to "Item:Q1027158"

The following pages link to A tutorial on geometric programming (Q1027158):

Displaying 50 items.

• A study on the anonymity of pairwise comparisons in group decision making (Q2312343) (← links)
• An improved geometric programming approach for optimization of biochemical systems (Q2336665) (← links)
• Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction (Q2355104) (← links)
• Data fitting with geometric-programming-compatible softmax functions (Q2358087) (← links)
• Temporal network epidemiology (Q2360278) (← links)
• Optimization of biochemical systems through mathematical programming: methods and applications (Q2379651) (← links)
• MM algorithms for geometric and signomial programming (Q2436647) (← links)
• (Q2770469) (← 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)
• Deniable Functional Encryption (Q2798776) (← links)
• Lower bounds for polynomials with simplex Newton polytopes based on geometric programming (Q2805707) (← links)
• Relative entropy relaxations for signomial optimization (Q2805708) (← links)
• On the largest eigenvalue of a symmetric nonnegative tensor (Q2936740) (← links)
• Solving geometric programming problems with fuzzy random variable coefficients (Q2953484) (← links)
• Designing globally optimal delta-sigma modulator topologies via signomial programming (Q3018533) (← links)
• Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
• (Q3337964) (← links)
• Solving a posynomial geometric programming problem with fully fuzzy approach (Q3388431) (← links)
• (Q3585636) (← links)
• (Q4565797) (← links)
• GRAPHICAL MODELS FOR CORRELATED DEFAULTS (Q4919613) (← links)
• A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints (Q4969032) (← links)
• Posynomial Geometric Programming with Intuitionistic Fuzzy Coefficients (Q4977920) (← links)
• On the Fuzzy Fractional Posynomial Geometric Programming Problems (Q4977928) (← links)
• (Q5028510) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY (Q5076115) (← links)
• Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848) (← links)
• (Q5154521) (← links)
• Optimal Containment of Epidemics over Temporal Activity-Driven Networks (Q5231203) (← links)
• Conic Geometric Optimization on the Manifold of Positive Definite Matrices (Q5252529) (← links)
• A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)
• A Positivstellensatz for Sums of Nonnegative Circuit Polynomials (Q5369248) (← links)
• (Q5557595) (← links)
• Information-based measure of nonlocality (Q5854930) (← links)
• Distributionally Robust Chance Constrained Geometric Optimization (Q5870361) (← links)
• Geometric Programming for Communication Systems (Q5898665) (← links)
• Geometric Programming for Communication Systems (Q5900270) (← links)
• Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry (Q5963080) (← links)
• A method of sequential log-convex programming for engineering design (Q6050371) (← links)
• A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian network (Q6065614) (← links)
• Geometric compromise programming: application in portfolio selection (Q6079996) (← links)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• Robust chance-constrained geometric programming with application to demand risk mitigation (Q6161554) (← links)
• Hyperloop system optimization (Q6173780) (← links)
• Data fitting with signomial programming compatible difference of convex functions (Q6173781) (← links)
• Quantum theory in finite dimension cannot explain every general process with finite memory (Q6202449) (← links)
• Profit maximization inventory model with uncertain demand and costs: a geometric programming approach (Q6536936) (← links)
• On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)