Pages that link to "Item:Q1373722"
From MaRDI portal
The following pages link to A dual-active-set algorithm for positive semi-definite quadratic programming (Q1373722):
Displaying 15 items.
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- Redundancies in positive-semidefinite quadratic programming (Q597191) (← links)
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- Computing upper and lower bounds in interval decision trees (Q877064) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
- Convex optimization techniques in compliant assembly simulation (Q2218917) (← links)
- A decomposition algorithm for solving large-scale quadratic programming problems (Q2489180) (← links)
- A dual method for solving positive definite quadratic programming (Q2735430) (← links)
- Dual support method for solving convex quadratic programs (Q2786329) (← links)
- On the quadratic programming algorithm of Goldfarb and Idnani (Q3710303) (← links)
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization (Q3740142) (← links)
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems (Q3813167) (← links)
- A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty (Q5925864) (← links)
