A parametric linearizing approach for quadratically inequality constrained quadratic programs

DOI10.1515/MATH-2018-0037MaRDI QIDQ1644881zbMATH OpenOpenAlexWikidataFDO

Authors Rongjiang Chen, Hong-Wei Jiao

Publication date 22 June 2018

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/math-2018-0037

zbMATH Keywords

global optimizationinterval deleting ruleparametric linearizing techniquequadratically inequality constrained quadratic programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Recommendations

• An effective algorithm for globally solving quadratic programs using parametric linearization technique
• scientific article; zbMATH DE number 7366738
• A global optimization algorithm using parametric linearization relaxation
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
• Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint

Cites work

• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• A deterministic global optimization algorithm for generalized geometric programming
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A global optimization algorithm for generalized quadratic programming
• A global optimization algorithm using parametric linearization relaxation
• A global optimization approach for quadratic programs with nonconvex quadratic constraints
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
• Approximation algorithms for quadratic programming
• Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
• Branch-reduction-bound algorithm for generalized geometric programming
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• Global minimization of a generalized linear multiplicative programming
• Global optimization of generalized geometric programming
• Linear decomposition approach for a class of nonconvex programming problems
• Linearization method of global optimization for generalized geometric programming
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• Solving a class of generalized fractional programming problems using the feasibility of linear programs

Cited in

(4)

• An effective algorithm for globally solving quadratic programs using parametric linearization technique
• An effective global optimization algorithm for quadratic programs with quadratic constraints
• scientific article; zbMATH DE number 4140226 (Why is no real title available?)
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints

This page was built for publication: A parametric linearizing approach for quadratically inequality constrained quadratic programs

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