Tractable approximate robust geometric programming
DOI10.1007/S11081-007-9025-ZzbMATH Open1176.90399OpenAlexW2123309836MaRDI QIDQ833439FDOQ833439
Authors: Kan-Lin Hsiung, Seung-Jean Kim, Stephen Boyd 
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-007-9025-z
Recommendations
linear programmingrobust optimizationgeometric programmingrobust linear programmingpiecewise-linear functionrobust geometric programming
Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Applications of second-order cone programming
- Robust solutions of uncertain linear programs
- On Polyhedral Approximations of the Second-Order Cone
- Robust convex optimization
- Robust Solutions to Uncertain Semidefinite Programs
- A tutorial on geometric programming
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Robust convex quadratically constrained programs
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- Mathematical Programming Models for Environmental Quality Control
- Convex Approximation by Rational Functions
- Digital Circuit Optimization via Geometric Programming
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Title not available (Why is that?)
- Monotone and Convex Approximation by Splines: Error Estimates and a Curve Fitting Algorithm
- Convexity Preserving Approximation by Free Knot Splines
- Solution of generalized geometric programs
- Interpolation by Convex Quadratic Splines
- Geometric Programming: Methods, Computations and Applications
- Maximum likelihood estimates for multinomial probabilities via geometric programming
- Geometric Programming
- OR Practice—Solving Complex Chemical Equilibria Using a Geometric-Programming Based Technique
- Tractable approximate robust geometric programming
- Convex Approximation by Splines
- Advances in geometric programming
- Posynomial geometric programming as a special case of semi-infinite linear programming
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- Optimal permutation codes for the Gaussian channel
Cited In (19)
- A neural network approach to solve geometric programs with joint probabilistic constraints
- Distributionally Robust Chance Constrained Geometric Optimization
- Copula theory approach to stochastic geometric programming
- Robust chance-constrained geometric programming with application to demand risk mitigation
- Structural filtering: a paradigm for efficient and exact geometric programs
- Reformulations in Mathematical Programming: Definitions and Systematics
- A tutorial on geometric programming
- Variation-aware clock network buffer sizing using robust multi-objective optimization
- Recent advances in robust optimization: an overview
- A practicable robust counterpart formulation for decomposable functions: a network congestion case study
- Tractable approximation to robust nonlinear production frontier problem
- A geometric branch and bound method for robust maximization of convex functions
- On the complexity of robust geometric programming with polyhedral uncertainty
- Robust geometric programming approach to profit maximization with interval uncertainty
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- Relative entropy optimization and its applications
- Data fitting with geometric-programming-compatible softmax functions
- Robust convex optimization: a new perspective that unifies and extends
- Tractable approximate robust geometric programming
This page was built for publication: Tractable approximate robust geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833439)
