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