Pages that link to "Item:Q1278947"
From MaRDI portal
The following pages link to A new penalty function algorithm for convex quadratic programming (Q1278947):
Displaying 12 items.
- An interior-exterior approach for convex quadratic programming (Q436003) (← links)
- Algorithm for inequality-constrained least squares problems (Q520270) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings (Q710681) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- A dynamic system approach to quadratic programming problems with penalty method (Q2655431) (← links)
- An Algorithm for Unconstrained Quadratically Penalized Convex Optimization (Q3087581) (← links)
- (Q4876139) (← links)
- (Q5277482) (← links)
- An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851) (← links)