A new primal-dual interior-point algorithm for convex quadratic optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6515403
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
Cites work
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A new polynomial-time algorithm for linear programming
- A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms
- On a homogeneous algorithm for the monotone complementarity problem
- On the existence and convergence of the central path for convex programming and some duality results
Cited in
(17)- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- Reduction of truss topology optimization
- Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
- Closing the iteration gap in linear programming with a new kernel function
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
This page was built for publication: A new primal-dual interior-point algorithm for convex quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320227)
