Pages that link to "Item:Q3200887"
From MaRDI portal
The following pages link to An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations (Q3200887):
Displaying 29 items.
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- A new algorithm for quadratic programming (Q1097172) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Minimal representation of convex regions defined by analytic functions (Q1577971) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- A full-step interior-point algorithm for linear complementarity problem based on a simple function (Q2903245) (← links)
- Short-step primal-dual target-following algorithms for the convex quadratic problems (Q2913902) (← links)
- On uniform consistent estimators for convex regression (Q3106431) (← links)
- Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322) (← links)
- An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665) (← links)
- Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming (Q5423153) (← links)
- Properties Of Primal Interior Point Methods For QP<sup>∗</sup> (Q5689843) (← links)
- Characterization of optimal points in binary convex quadratic programming (Q5758206) (← links)
- Dynamic thresholding algorithm with memory for linear inverse problems (Q6659673) (← links)
