Pages that link to "Item:Q2638936"
From MaRDI portal
The following pages link to An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936):
Displaying 31 items.
- Algorithm for inequality-constrained least squares problems (Q520270) (← links)
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← 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 polynomial method of approximate centers for linear programming (Q1196720) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- Long-step primal path-following algorithm for monotone variational inequality problems (Q1275718) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems (Q1321256) (← links)
- Infinite-dimensional quadratic optimization: Interior-point methods and control applications (Q1363637) (← links)
- Maximum margin semi-supervised learning with irrelevant data (Q1669167) (← links)
- Computational schemes for large-scale problems in extended linear- quadratic programming (Q1813335) (← links)
- The Newton modified barrier method for QP problems (Q1915923) (← links)
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems (Q1919097) (← links)
- Fast quadratic programming for mean-variance portfolio optimisation (Q2226482) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems (Q2231049) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis (Q2483030) (← links)
- Efficient differentiable quadratic programming layers: an ADMM approach (Q2696912) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
- Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- An interior point algorithm for convex quadratic programming with strict equilibrium constraints (Q5710540) (← links)
- Log-domain interior-point methods for convex quadratic programming (Q6164958) (← links)