Pages that link to "Item:Q1027158"

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

Displaying 50 items.

• Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions (Q280969) (← links)
• Global optimization of signomial geometric programming problems (Q296971) (← links)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• Convex piecewise-linear fitting (Q374609) (← links)
• Engineering design by geometric programming (Q460111) (← links)
• Lower bounds on the global minimum of a polynomial (Q461443) (← 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)
• The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
• Relative entropy optimization and its applications (Q507310) (← links)
• Stochastic geometric programming with joint probabilistic constraints (Q510924) (← links)
• Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
• Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
• Estimating cell probabilities in contingency tables with constraints on marginals/conditionals by geometric programming with applications (Q736994) (← links)
• Rectangular chance constrained geometric optimization (Q779767) (← links)
• Tropical varieties for exponential sums (Q785323) (← links)
• Tractable approximate robust geometric programming (Q833439) (← links)
• Sparse identification of posynomial models (Q894327) (← links)
• Maximum likelihood estimation of ordered multinomial probabilities by geometric programming (Q961209) (← links)
• New geometric programming algorithms with numerical experiments (Q1068000) (← links)
• On geometric programming and complementary slackness (Q1321217) (← links)
• Large scale geometric programming: An application in coding theory (Q1332821) (← links)
• Semidefinite approximations of the matrix logarithm (Q1740571) (← links)
• An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
• Stochastic geometric optimization with joint probabilistic constraints (Q1755848) (← links)
• Fuzzy pricing, marketing and service planning in a fuzzy inventory model: a geometric programming approach (Q1788955) (← links)
• A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
• Multi-objective geometric programming problem with \(\epsilon\)-constraint method (Q1991380) (← links)
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
• Robust budget allocation via continuous submodular functions (Q2019911) (← links)
• Incentive rate determination in viral marketing (Q2029294) (← links)
• Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2030620) (← links)
• Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• KDE distributionally robust portfolio optimization with higher moment coherent risk (Q2070731) (← links)
• Acceptable set topic modeling (Q2077938) (← links)
• Log-log convexity of an optimal control problem for positive linear systems (Q2097706) (← links)
• Measurements of quantum Hamiltonians with locally-biased classical shadows (Q2124207) (← links)
• Optimization on flag manifolds (Q2149562) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• An efficient method for solving multi-objective signomial programming problems in real life (Q2170947) (← links)
• On generalizing Descartes' rule of signs to hypersurfaces (Q2172219) (← links)
• Optimisation problems as decision problems: the case of fuzzy optimisation problems (Q2198212) (← links)
• DCA-based algorithms for DC fitting (Q2226279) (← links)
• Copula theory approach to stochastic geometric programming (Q2231327) (← links)
• Co-design of safe and efficient networked control systems in factory automation with state-dependent wireless fading channels (Q2280705) (← links)
• On the complexity of robust geometric programming with polyhedral uncertainty (Q2294257) (← links)
• Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
• The decompositions with respect to two core non-symmetric cones (Q2301185) (← links)
• Disciplined geometric programming (Q2311189) (← links)