On quadratic and complete quadratic problems of convex programming
From MaRDI portal
Recommendations
- On convex relaxations for quadratically constrained quadratic programming
- On the convexity and existence of solutions to quadratic programming problems with convex constraint
- On convex quadratic programs with linear complementarity constraints
- On a class of quadratic programs
- scientific article; zbMATH DE number 2205685
- On solvability of convex noncoercive quadratic programming problems
- On solving convex quadratic semi-infinite programming probelms
- scientific article; zbMATH DE number 57066
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
- scientific article; zbMATH DE number 757652
Cited in
(23)- Interval convex quadratic programming problems in a general form
- A note on the strong polynomiality of convex quadratic programming
- Regularization and normal solutions of systems of linear equations and inequalities
- scientific article; zbMATH DE number 3970535 (Why is no real title available?)
- scientific article; zbMATH DE number 3924514 (Why is no real title available?)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- On convex quadratic programs with linear complementarity constraints
- A note on composite concave quadratic programming
- scientific article; zbMATH DE number 1775264 (Why is no real title available?)
- The quadratic M-convexity testing problem
- On convex relaxations for quadratically constrained quadratic programming
- scientific article; zbMATH DE number 4003916 (Why is no real title available?)
- scientific article; zbMATH DE number 4068621 (Why is no real title available?)
- Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality
- scientific article; zbMATH DE number 4033495 (Why is no real title available?)
- scientific article; zbMATH DE number 823370 (Why is no real title available?)
- A quadratic programming problem arising from the \(p\)-version for obstacle problems
- On two questions of optimization theory concerning quadratic mappings
- Projective-dual method for solving systems of linear equations with nonnegative variables
- Solving conic quadratically constrained quadratic programming problems
- On solving convex quadratic semi-infinite programming probelms
- Generalized Newton method for linear optimization problems with inequality constraints
- scientific article; zbMATH DE number 7152114 (Why is no real title available?)
This page was built for publication: On quadratic and complete quadratic problems of convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589846)
