Pages that link to "Item:Q1589846"
From MaRDI portal
The following pages link to On quadratic and complete quadratic problems of convex programming (Q1589846):
Displaying 20 items.
- Generalized Newton method for linear optimization problems with inequality constraints (Q483411) (← links)
- Regularization and normal solutions of systems of linear equations and inequalities (Q492280) (← links)
- A note on composite concave quadratic programming (Q1306393) (← links)
- Projective-dual method for solving systems of linear equations with nonnegative variables (Q1644007) (← links)
- The quadratic M-convexity testing problem (Q1701120) (← links)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
- On two questions of optimization theory concerning quadratic mappings (Q1758040) (← links)
- Interval convex quadratic programming problems in a general form (Q1788939) (← links)
- A note on the strong polynomiality of convex quadratic programming (Q1804355) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- A quadratic programming problem arising from the \(p\)-version for obstacle problems (Q2861512) (← links)
- Solving conic quadratically constrained quadratic programming problems (Q2928413) (← links)
- (Q3737241) (← links)
- (Q3773700) (← links)
- (Q3801347) (← links)
- (Q4542378) (← links)
- On solving convex quadratic semi-infinite programming probelms (Q4764835) (← links)
- (Q4856857) (← links)
- (Q5208413) (← links)