Disciplined geometric programming
From MaRDI portal
Abstract: We introduce log-log convex programs, which are optimization problems with positive variables that become convex when the variables, objective functions, and constraint functions are replaced with their logs, which we refer to as a log-log transformation. This class of problems generalizes traditional geometric programming and generalized geometric programming, and it includes interesting problems involving nonnegative matrices. We give examples of log-log convex functions, some well-known and some less so, and we develop an analog of disciplined convex programming, which we call disciplined geometric programming. Disciplined geometric programming is a subclass of log-log convex programming generated by a composition rule and a set of functions with known curvature under the log-log transformation. Finally, we describe an implementation of disciplined geometric programming as a reduction in CVXPY 1.0.
Recommendations
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A CONVEXITY PROPERTY OF POSITIVE MATRICES
- A note on geometrically convex functions
- A tutorial on geometric programming
- CVXPY: a Python-embedded modeling language for convex optimization
- Convexity according to the geometric mean
- Convexity and log convexity for the spectral radius
- Data fitting with geometric-programming-compatible softmax functions
- Digital Circuit Optimization via Geometric Programming
- Disciplined convex programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Geometric Programming for Communication Systems
- Geometrically concave univariate distributions
- Graph implementations for nonsmooth convex programs
- Log-concave probability and its applications
- Mathematical Programming Models for Environmental Quality Control
- On Mulholland’s inequality
- Optimal Compression in Natural Gas Networks: A Geometric Programming Approach
- Optimal Resource Allocation for Network Protection Against Spreading Processes
- Optimization of biochemical systems through mathematical programming: methods and applications
- Spectral properties of operator polynomials with nonnegative coefficients
- The Solution of the Chemical Equilibrium Programming Problem with Generalized Benders Decomposition
- Wireless network optimization by Perron-Frobenius theory
Cited in
(14)- Signomial and polynomial optimization via relative entropy and partial dualization
- Log-log convexity of an optimal control problem for positive linear systems
- Graph implementations for nonsmooth convex programs
- Russell graph efficiency measures in data envelopment analysis: the multiplicative approach
- Performance enhancements for a generic conic interior point algorithm
- Disciplined quasiconvex programming
- Some mathematical properties of the premium function and ruin probability of a generalized Cramér-Lundberg model driven by mixed Poisson processes
- Hyperloop system optimization
- Solving Natural Conic Formulations with Hypatia.jl
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Transforming optimization problems into disciplined convex programming form
- A method of sequential log-convex programming for engineering design
- Sublinear circuits and the constrained signomial nonnegativity problem
- Disciplined convex programming
This page was built for publication: Disciplined geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311189)
