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):
Displaying 14 items.
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- CECM: constrained evidential \(C\)-means algorithm (Q433252) (← links)
- An interior-exterior approach for convex quadratic programming (Q436003) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- Extension of a projective interior point method for linearly constrained convex programming (Q990634) (← links)
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (Q2025288) (← links)
- Optimal pricing policy design for selling cost-reducing innovation in Cournot games (Q2067618) (← links)
- A positive and stable L2-minimization based moment method for the Boltzmann equation of gas dynamics (Q2129337) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Robustness to rank reversal in pairwise comparison matrices based on uncertainty bounds (Q2171613) (← links)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
