A global optimization algorithm using parametric linearization relaxation
From MaRDI portal
Publication:876659
DOI10.1016/J.AMC.2006.08.028zbMATH Open1116.65070OpenAlexW2025447152MaRDI QIDQ876659FDOQ876659
Kecun Zhang, Ying Ji, Shaojian Qu
Publication date: 26 April 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.028
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05)
Cites Work
- Constrained global optimization: algorithms and applications
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Global optimization of generalized geometric programming
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
- Prediction of oligopeptide conformations via deterministic global optimization
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Primal-relaxed dual global optimization approach
- Approximating global quadratic optimization with convex quadratic constraints
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- Synthesis of globally optimal controllers for robust performance to unstructured uncertainty
- Convergent outer approximation algorithms for solving unary programs
- Difference of convex solution of quadratically constrained optimization problems.
Cited In (8)
- 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 parametric linearizing approach for quadratically inequality constrained quadratic programs
- 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
Recommendations
- A global optimization algorithm using linear relaxation 👍 👎
- A global optimization algorithm for generalized quadratic programming 👍 👎
- Title not available (Why is that?) 👍 👎
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming 👍 👎
- An effective algorithm for globally solving quadratic programs using parametric linearization technique 👍 👎
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)
