A parametric linearizing approach for quadratically inequality constrained quadratic programs

DOI10.1515/math-2018-0037zbMath1391.90453OpenAlexW2803098265MaRDI QIDQ1644881

Rongjiang Chen, Hong-Wei Jiao

Publication date: 22 June 2018

Published in: Open Mathematics (Search for Journal in Brave)

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) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (2)

An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints

Cites Work

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

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