A set of geometric programming test problems and their solutions

Cites work

Cited in

(40)

Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems
Reduction of indefinite quadratic programs to bilinear programs
A robust algorithm for quadratic optimization under quadratic constraints
A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
New geometric programming algorithms with numerical experiments
Reversed geometric programming: A branch-and-bound method involving linear subproblems
Multi-parametric disaggregation technique for global optimization of polynomial programming problems
New simulated annealing algorithms for constrained optimization
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
An ellipsoid algorithm for nonlinear programming
Current state of the art of algorithms and computer software for geometric programming
Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
An analytical approach to global optimization
A new technique for inconsistent QP problems in the SQP method
A global interior point method for nonconvex geometric programming
Local search enhanced aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems
Computational experience with penalty-barrier methods for nonlinear programming
Test example for nonlinear programming codes
A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
Experiments with successive quadratic programming algorithms
An SQP method for general nonlinear programs using only equality constrained subproblems
Scaling nonlinear programs
Comparative assessment of algorithms and software for global optimization
Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
Linearization method of global optimization for generalized geometric programming
An infeasible interior-point algorithm for solving primal and dual geometric programs
A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
An interior point potential reduction method for constrained equations
A MILP formulation for generalized geometric programming using piecewise-linear approximations
``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
Performance of several nonlinear programming software packages on microcomputers.
Best practices for comparing optimization algorithms
Global optimization of signomial geometric programming problems
Active set strategies in an ellipsoid algorithm for nonlinear programming
An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
Penalty functions, Newton's method, and quadratic programming
Remarks on solutions to a nonconvex quadratic programming test problem
Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras

This page was built for publication: A set of geometric programming test problems and their solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120280)