Pages that link to "Item:Q4120280"

The following pages link to A set of geometric programming test problems and their solutions (Q4120280):

Displaying 34 items.

• Global optimization of signomial geometric programming problems (Q296971) (← links)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• Remarks on solutions to a nonconvex quadratic programming test problem (Q540711) (← links)
• Comparative assessment of algorithms and software for global optimization (Q813366) (← links)
• Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems (Q1053602) (← links)
• New geometric programming algorithms with numerical experiments (Q1068000) (← links)
• Experiments with successive quadratic programming algorithms (Q1090233) (← links)
• Penalty functions, Newton's method, and quadratic programming (Q1093530) (← links)
• A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming (Q1123811) (← links)
• Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization (Q1131824) (← links)
• Reversed geometric programming: A branch-and-bound method involving linear subproblems (Q1141082) (← links)
• Scaling nonlinear programs (Q1167667) (← links)
• An analytical approach to global optimization (Q1181733) (← links)
• Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
• Current state of the art of algorithms and computer software for geometric programming (Q1243249) (← links)
• Test example for nonlinear programming codes (Q1252157) (← links)
• An SQP method for general nonlinear programs using only equality constrained subproblems (Q1290629) (← links)
• A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
• An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
• Performance of several nonlinear programming software packages on microcomputers. (Q1406691) (← links)
• Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
• Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
• ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
• An interior point potential reduction method for constrained equations (Q1814789) (← links)
• Computational experience with penalty-barrier methods for nonlinear programming (Q1915922) (← links)
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
• Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
• A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
• Investigating a hybrid simulated annealing and local search algorithm for constrained optimization (Q2464206) (← links)
• An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
• Local search enhanced aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems (Q6102647) (← links)