Pages that link to "Item:Q434155"
From MaRDI portal
The following pages link to Adaptive constraint reduction for convex quadratic programming (Q434155):
Displaying 10 items.
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (Q306395) (← links)
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- Adaptive algorithm for constrained least-squares problems (Q1862189) (← links)
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- On the augmented subproblems within sequential methods for nonlinear programming (Q2403109) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)