Live briefing
Everything about Geometric programming
Optimization problem
A geometric program (GP) is an optimization problem of the form Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Geometric programmingA 5-minute orientation
- Skim a recent paper: Programming correlated magnetic states with gate-controlled moiré geometryInfluential work since 2022
- Pick up a classic book: Landsat-4 science characterization early resultsThe most-reprinted book on the subject
- Read the landmark paper: A tutorial on geometric programmingCited 883 times
- Go sideways: SignomialA closely related topic
- Go sideways: Conic optimizationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A tutorial on geometric programming
Power Control By Geometric Programming
Geometric Programming for Communication Systems
Complementary Geometric Programming
Geometric Programming
Geometric programming with signomials
A geometric method in nonlinear programming
Geometric Programming for Aircraft Design Optimization
🆕 Influential since 2022
Programming correlated magnetic states with gate-controlled moiré geometry
Geometric semantic genetic programming with normalized and standardized random programs
GSGP-CUDA — A CUDA framework for Geometric Semantic Genetic Programming
A study of dynamic populations in geometric semantic genetic programming
Programming time-dependent behavior in 4D printing by geometric and printing parameters
📚 Books worth reading
- 📕Landsat-4 science characterization early resultsLandsat-4 Science Characterization Early Results Symposium (1983 Greenbelt, Md.) · 1985
- 📕Geometric modeling for computer-aided designJames L. Schwing · 1987
- 📕A survey of underwater-acoustic ray tracing techniquesR. Michael Jones · 1983
Geometric Programming for Computer Aided DesignAlberto Paoluzzi · 2003
A programmer's geometryAdrian Bowyer, John Woodwark · 1983- 📕Design and Implementation of 3D Graphics SystemsJonas de Miranda Gomes, Luiz Velho · 2012
A Generative Theory of ShapeMichael Leyton · 2001
Geometric OpticsAntonio Romano · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Signomial A signomial is a kind of function of one or more independent variables. It is perhaps most easily thought of as an extension of multivariable polynomials—an…
- Conic optimization Conic optimization is a subfield of convex optimization that studies problems consisting of minimizing a convex function over the intersection of an affine…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Karush–Kuhn–Tucker conditions In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes…
- Closed convex function In mathematics, a function f : R n → R {\displaystyle f:\mathbb {R} ^{n}\rightarrow \mathbb {R} } is said to be closed if for each α ∈ R {\displaystyle…
- Sequential quadratic programming Sequential quadratic programming (SQP) is an iterative method for constrained nonlinear optimization, also known as Lagrange-Newton method. SQP methods…
- Proper convex function In mathematical analysis, in particular the subfields of convex analysis and optimization, a proper convex function is an extended real-valued convex function…