A global optimization algorithm using parametric linearization relaxation
From MaRDI portal
Recommendations
- A global optimization algorithm using linear relaxation
- A global optimization algorithm for generalized quadratic programming
- scientific article; zbMATH DE number 5630592
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
Cites work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Approximating global quadratic optimization with convex quadratic constraints
- Constrained global optimization: algorithms and applications
- Convergent outer approximation algorithms for solving unary programs
- Difference of convex solution of quadratically constrained optimization problems.
- Global optimization of generalized geometric programming
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Prediction of oligopeptide conformations via deterministic global optimization
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
- Primal-relaxed dual global optimization approach
- Synthesis of globally optimal controllers for robust performance to unstructured uncertainty
Cited in
(11)- An accelerating algorithm for globally solving nonconvex quadratic programming
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
- A global optimization algorithm using linear relaxation
- A parametric linearizing approach for quadratically inequality constrained quadratic programs
- A Method for Global Optimization of Large Systems of Quadratic Constraints
- A reliable affine relaxation method for global optimization
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- A global optimization algorithm for generalized quadratic programming
This page was built for publication: A global optimization algorithm using parametric linearization relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876659)