Disciplined geometric programming
From MaRDI portal
Publication:2311189
DOI10.1007/S11590-019-01422-ZzbMath1425.90078arXiv1812.04074OpenAlexW2904160524MaRDI QIDQ2311189
Akshay Agrawal, Steven Diamond, Stephen P. Boyd
Publication date: 10 July 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04074
Related Items (11)
Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Solving Natural Conic Formulations with Hypatia.jl ⋮ MathOptInterface: A Data Structure for Mathematical Optimization Problems ⋮ A method of sequential log-convex programming for engineering design ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Sublinear circuits and the constrained signomial nonnegativity problem ⋮ Hyperloop system optimization ⋮ Russell graph efficiency measures in data envelopment analysis: the multiplicative approach ⋮ Some mathematical properties of the premium function and ruin probability of a generalized Cramér-Lundberg model driven by mixed Poisson processes ⋮ Transforming optimization problems into disciplined convex programming form ⋮ Log-log convexity of an optimal control problem for positive linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A tutorial on geometric programming
- Geometrically concave univariate distributions
- Convexity and log convexity for the spectral radius
- A note on geometrically convex functions
- Data fitting with geometric-programming-compatible softmax functions
- Optimization of biochemical systems through mathematical programming: methods and applications
- Log-concave probability and its applications
- Wireless Network Optimization by Perron-Frobenius Theory
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Graph Implementations for Nonsmooth Convex Programs
- A CONVEXITY PROPERTY OF POSITIVE MATRICES
- The Solution of the Chemical Equilibrium Programming Problem with Generalized Benders Decomposition
- Convexity according to the geometric mean
- On Mulholland’s inequality
- Mathematical Programming Models for Environmental Quality Control
- Digital Circuit Optimization via Geometric Programming
- Optimal Resource Allocation for Network Protection Against Spreading Processes
- Optimal Compression in Natural Gas Networks: A Geometric Programming Approach
- Geometric Programming for Communication Systems
This page was built for publication: Disciplined geometric programming