KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
DOI10.1137/100793955zbMATH Open1242.49044DBLPjournals/siamjo/LuFJWX11OpenAlexW2074925460WikidataQ57438045 ScholiaQ57438045MaRDI QIDQ3225239FDOQ3225239
Authors: Cheng Lu, Shu-Cherng Fang, Qingwei Jin, Zhenbo Wang, Wenxun Xing 
Publication date: 16 March 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a9af3e07837ee3c06e72cf3e6ec5647f4c22e304
Recommendations
- Solving conic quadratically constrained quadratic programming problems
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- Globally solving nonconvex quadratic programming problems via completely positive programming
conic programmingquadratically constrained quadratic programmingglobal optimality conditionsolvable condition
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Linear-quadratic optimal control problems (49N10) Optimality conditions for free problems in two or more independent variables (49K10)
Cited In (21)
- Semidefinite representable reformulations for two variants of the trust-region subproblem
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- The unconstrained binary quadratic programming problem: a survey
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- Quadratic optimization over a polyhedral cone
- Global solutions to a class of CEC benchmark constrained optimization problems
- On conic QPCCs, conic QCQPs and completely positive programs
- Completely positive and copositive program modelling for quadratic optimization problems
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- An approximation algorithm for optimal piecewise linear interpolations of bounded variable products
- Maximum probability O-D matrix estimation in large-sized networks
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
- Architecting a fully fuzzy information model for multi-level quadratically constrained quadratic programming problem
- Convex hull results on quadratic programs with non-intersecting constraints
This page was built for publication: KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225239)
