On the public citation graph
Comparison of generalized geometric programming algorithms
0 signed · 92 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/aic.690170145openalex-snapshot
A Lagrangian algorithm for equality constrained generalized polynomial optimization
inferredcites →https://doi.org/10.1002/aic.690200416openalex-snapshot
Analysis and optimization of the Williams‐Otto process by geometric programming
inferredcites →https://doi.org/10.1002/cjce.5450470401openalex-snapshot
Generalized polynomial programming
inferredcites →https://doi.org/10.1002/nme.1620090112openalex-snapshot
Solution of generalized geometric programs
inferredcites →https://doi.org/10.1007/bf00934288openalex-snapshot
Geometric programming with signomials
inferredcites →https://doi.org/10.1007/bf01535304openalex-snapshot
Mass action and polynomial optimization
inferredcites →https://doi.org/10.1007/bf01580373openalex-snapshot
A condensation method for generalized geometric programming
inferredcites →https://doi.org/10.1007/bf01584669openalex-snapshot
Projection methods for non-linear programming
inferredcites →https://doi.org/10.1007/bf02665292openalex-snapshot
A modified concave simplex algorithm for geometric programming
inferredcites →https://doi.org/10.1016/0022-247x(70)90303-3openalex-snapshot
Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programs
inferredcites →https://doi.org/10.1016/0041-5553(69)90146-3openalex-snapshot
Selected applications of non-linear programming
inferredcites →https://doi.org/10.1021/i260022a018openalex-snapshot
Optimal Condenser Design by Geometric Programming
inferredcites →https://doi.org/10.1021/i260039a026openalex-snapshot
Minimization of Capital Investment for Batch Processes
inferredcites →https://doi.org/10.1057/jors.1973.45openalex-snapshot
On the Solution of Geometric Programs via Separable Programming
inferredcites →https://doi.org/10.1093/comjnl/13.2.178openalex-snapshot
A new method for the optimization of a nonlinear function subject to nonlinear constraints
inferredcites →https://doi.org/10.1115/1.3423205openalex-snapshot
Optimization Techniques With FORTRAN
inferredcites →https://doi.org/10.1512/iumj.1973.22.22045openalex-snapshot
Reversed Geometric Programs Treated by Harmonic Means
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0358openalex-snapshot
Geometric Programming
inferred← citeshttps://doi.org/10.1002/cjce.5450630118openalex-snapshot
Comparison of primal and dual solution methods for the chemical equilibrium problem using GRG and sensitivity analysis
inferred← citeshttps://doi.org/10.1002/cnm.1640090907openalex-snapshot
Two problems with GGP generalized geometric programming algorithm
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_172openalex-snapshot
Global Optimization in Generalized Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_234openalex-snapshot
Global Optimization in Generalized Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-3600-0_30openalex-snapshot
First-and Second-Order Convex Programming Scaling Algorithms Applied to Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-30217-9_30openalex-snapshot
Exploring the Evolutionary Details of a Feasible-Infeasible Two-Population GA
inferred← citeshttps://doi.org/10.1007/978-3-642-45527-8_24openalex-snapshot
Multidimensional Locational Decisions and Interactive Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-45567-4_35openalex-snapshot
New Algorithms and Results of Numerical Experiments for Solution of Mathematical Programming and Optimal Control Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-59051-1_27openalex-snapshot
Optimization in Probabilistic Logic for Decision Support Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_5openalex-snapshot
Reflections on Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_8openalex-snapshot
Comparative Performance Evaluation, Experimental Design, and Generation of Test Problems in Non-Linear Optimization
inferred← citeshttps://doi.org/10.1007/978-981-13-5823-4_2openalex-snapshot
Signomial Geometric Programming (GP) Problem
inferred← citeshttps://doi.org/10.1007/bf00934337openalex-snapshot
A cutting-plane algorithm with linear and geometric rates of convergence
inferred← citeshttps://doi.org/10.1007/bf00940759openalex-snapshot
A primal-dual Newton-type algorithm for geometric programs with equality constraints
inferred← citeshttps://doi.org/10.1007/bf01582014openalex-snapshot
Performance evaluation of nonlinear optimization methods via pairwise comparison and fuzzy numbers
inferred← citeshttps://doi.org/10.1007/bf02614382openalex-snapshot
An infeasible interior-point algorithm for solving primal and dual geometric programs
inferred← citeshttps://doi.org/10.1007/bf02895782openalex-snapshot
Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
inferred← citeshttps://doi.org/10.1007/s10898-007-9223-4openalex-snapshot
Some transformation techniques with applications in global optimization
inferred← citeshttps://doi.org/10.1007/s10898-012-0022-1openalex-snapshot
Global optimization of bilinear programs with a multiparametric disaggregation technique
inferred← citeshttps://doi.org/10.1007/s10898-012-9877-4openalex-snapshot
A reformulation framework for global optimization
inferred← citeshttps://doi.org/10.1007/s11081-017-9366-1openalex-snapshot
Best practices for comparing optimization algorithms
inferred← citeshttps://doi.org/10.1007/s11081-023-09815-xopenalex-snapshot
A global interior point method for nonconvex geometric programming
inferred← citeshttps://doi.org/10.1007/s12532-020-00193-4openalex-snapshot
Signomial and polynomial optimization via relative entropy and partial dualization
inferred← citeshttps://doi.org/10.1007/s12532-021-00201-1openalex-snapshot
Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization
inferred← citeshttps://doi.org/10.1016/0377-2217(81)90211-3openalex-snapshot
Interactive multidimensional programming models for locational decisions
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90041-xopenalex-snapshot
New geometric programming algorithms with numerical experiments
inferred← citeshttps://doi.org/10.1016/j.amc.2003.12.101openalex-snapshot
Linearization method of global optimization for generalized geometric programming
inferred← citeshttps://doi.org/10.1016/j.amc.2006.05.208openalex-snapshot
A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
inferred← citeshttps://doi.org/10.1016/j.amc.2011.08.066openalex-snapshot
A new hybrid method for solving global optimization problem
inferred← citeshttps://doi.org/10.1016/j.apm.2014.12.019openalex-snapshot
Solving nonlinear constrained optimization problems: An immune evolutionary based two-phase approach
inferred← citeshttps://doi.org/10.1016/j.apm.2015.03.025openalex-snapshot
Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
inferred← citeshttps://doi.org/10.1016/j.apm.2018.06.017openalex-snapshot
Hybrid optimization procedure applied to optimal location finding for piezoelectric actuators and sensors for active vibration control
inferred← citeshttps://doi.org/10.1016/j.ces.2015.01.029openalex-snapshot
A new look at the topographical global optimization method and its application to the phase stability analysis of mixtures
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2017.10.035openalex-snapshot
Solving global optimization problems using reformulations and signomial transformations
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2022.107700openalex-snapshot
COBALT: COnstrained Bayesian optimizAtion of computationaLly expensive grey-box models exploiting derivaTive information
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2024.108976openalex-snapshot
Bayesian optimization of gray-box process models using a modified upper confidence bound acquisition function
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.06.034openalex-snapshot
A global optimization using linear relaxation for generalized geometric programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.06.046openalex-snapshot
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.10.016openalex-snapshot
Global optimization of signomial geometric programming problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.01.038openalex-snapshot
A MILP formulation for generalized geometric programming using piecewise-linear approximations
inferred← citeshttps://doi.org/10.1016/j.orp.2026.100401openalex-snapshot
A global optimization algorithm for signomial geometric problem
inferred← citeshttps://doi.org/10.1016/j.physa.2019.122658openalex-snapshot
Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
inferred← citeshttps://doi.org/10.1016/s0096-3003(03)00200-5openalex-snapshot
Global optimization of signomial geometric programming using linear relaxation
inferred← citeshttps://doi.org/10.1016/s0098-1354(96)00282-7openalex-snapshot
Global optimization in generalized geometric programming
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00265-2openalex-snapshot
Investigation of path-following algorithms for signomial geometric programming problems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)63539-0openalex-snapshot
Constructive Methods of Parametric and Functional Optimization
inferred← citeshttps://doi.org/10.1017/s0334270000002307openalex-snapshot
Geometric programming with probabilistic decision variables
inferred← citeshttps://doi.org/10.1023/a:1008249414776openalex-snapshot
Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents
inferred← citeshttps://doi.org/10.1023/a:1013500514075openalex-snapshot
Solving Posynomial Geometric Programming Problems via Generalized Linear Programming
inferred← citeshttps://doi.org/10.1023/b:joth.0000013564.04407.82openalex-snapshot
On the Constructive Solution of Convex Programming Problems in Separable Form
inferred← citeshttps://doi.org/10.1080/02331939208843767openalex-snapshot
A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
inferred← citeshttps://doi.org/10.1080/02331939508844053openalex-snapshot
Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
inferred← citeshttps://doi.org/10.1080/02522667.1989.10698949openalex-snapshot
Fuzzy Performance Evaluation of Nonlinear Optimization Methods, with Sensitivity Analysis of the Final Scores
inferred← citeshttps://doi.org/10.1080/03052159508941362openalex-snapshot
OBTAINING A FEASIBLE GEOMETRIC PROGRAMMING PRIMAL SOLUTION, GIVEN A NEAR-OPTIMAL DUAL SOLUTION
inferred← citeshttps://doi.org/10.1080/08982112.2017.1315136openalex-snapshot
Nonconvex optimization of desirability functions
inferred← citeshttps://doi.org/10.1080/10170669.2000.10433300openalex-snapshot
Path-Following Algorithms for Posynomial Geometric Programming Problems
inferred← citeshttps://doi.org/10.1109/pecon.2012.6450282openalex-snapshot
Brain storm optimization algorithm based economic dispatch considering wind power
inferred← citeshttps://doi.org/10.1137/1022058openalex-snapshot
Geometric Programming: Methods, Computations and Applications
inferred← citeshttps://doi.org/10.1137/21m1462568openalex-snapshot
Algebraic Perspectives on Signomial Optimization
inferred← citeshttps://doi.org/10.1155/2012/841410openalex-snapshot
Solving Constrained Global Optimization Problems by Using Hybrid Evolutionary Computing and Artificial Life Approaches
inferred← citeshttps://doi.org/10.1155/2014/163263openalex-snapshot
A Global Optimization Algorithm for Signomial Geometric Programming Problem
inferred← citeshttps://doi.org/10.1177/002224298504900113openalex-snapshot
The Application of Geometric Programming to Marketing Problems
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0403openalex-snapshot
An Efficient Global Approach for Posynomial Geometric Programming Problems
inferred← citeshttps://doi.org/10.1504/ijmr.2023.10050481openalex-snapshot
Determination of cost-effective range in surface finish for single pass turning
inferred← citeshttps://doi.org/10.20965/jaciii.2007.p0358openalex-snapshot
Real-Coded Genetic Algorithm for Solving Generalized Polynomial Programming Problems
inferred← citeshttps://doi.org/10.22481/intermaths.v5i2.15261openalex-snapshot
Aplicação da Programação Geométrica na Gestão de Qualidade da Água
inferred← citeshttps://doi.org/10.33915/etd.5046openalex-snapshot
Determination of Cost-Effective Range in Surface Finish for Single Pass Turning
inferred← citeshttps://doi.org/10.37885/978-65-5360-558-9openalex-snapshot
Formulação teórica dos fundamentos da otimização global topográfica com análise de desempenho e aplicações à estabilidade de fases de misturas termodinâmicas
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.