Pages that link to "Item:Q5287104"
From MaRDI portal
The following pages link to A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds (Q5287104):
Displaying 8 items.
- Fast optimization-based conservative remap of scalar fields through aggregate mass transfer (Q347769) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
- Discontinuous piecewise linear optimization (Q1380942) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
