Pages that link to "Item:Q1121792"
From MaRDI portal
The following pages link to An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792):
Displayed 31 items.
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions (Q688916) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- On solving \(L_{q}\)-penalized regressions (Q933880) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- Generalization of Karmarkar's algorithm to convex homogeneous functions (Q1197885) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems (Q1312782) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- A branch bound method for subset sum problem (Q1343509) (← links)
- Duality in robust linear regression using Huber's \(M\)-estimator (Q1372307) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Monotone variable-metric algorithm for linearly constrained nonlinear programming (Q1579655) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization (Q1811590) (← links)
- Computational schemes for large-scale problems in extended linear- quadratic programming (Q1813335) (← links)
- Two-stage estimation of inequality-constrained marginal linear models with longitudinal data (Q2480042) (← links)
- An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints (Q2485615) (← links)
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables (Q2489419) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- An interior point algorithm for global optimal solutions and KKT points (Q2770190) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
- Properties Of Primal Interior Point Methods For QP<sup>∗</sup> (Q5689843) (← links)