Pages that link to "Item:Q1919097"
From MaRDI portal
The following pages link to Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems (Q1919097):
Displaying 12 items.
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← links)
- Extension of a projective interior point method for linearly constrained convex programming (Q990634) (← links)
- Applications of second-order cone programming (Q1124764) (← links)
- Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization (Q2802529) (← links)
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming (Q4504779) (← links)
- An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications (Q5003212) (← links)
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
