Pages that link to "Item:Q1158735"
From MaRDI portal
The following pages link to A computational method for the indefinite quadratic programming problem (Q1158735):
Displayed 13 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method (Q651143) (← links)
- On the numerical realization of the exact penalty method for quadratic programming algorithms (Q751516) (← links)
- A note on weakly active constraints in connection with nonconvex quadratic programming (Q1197678) (← links)
- Fault diagnosis in condition of sample type incompleteness using support vector data description (Q1665664) (← links)
- Fault isolation for nonlinear systems using flexible support vector regression (Q1719006) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- Sparse quadratic programming in chemical process optimization (Q2368094) (← links)
- Adaptive tetrahedral meshing in free-surface flow (Q2485726) (← links)
- A weighted gram-schmidt method for convex quadratic programming (Q3337227) (← links)
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem (Q3720303) (← links)
- Optimization of a nonlinear Hermitian matrix expression with application (Q5157480) (← links)