A polynomial arc-search interior-point algorithm for convex quadratic programming
From MaRDI portal
Recommendations
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- The arc-search interior-point algorithm
Cites work
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3511136 (Why is no real title available?)
- scientific article; zbMATH DE number 1163807 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A new polynomial-time algorithm for linear programming
- Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Convergence behavior of interior-point algorithms
- Handbook of mathematics for engineers and scientists
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- LOQO:an interior point code for quadratic programming
- Multiple centrality corrections in a primal-dual method for linear programming
- Numerical Optimization
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Test examples for nonlinear programming codes
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
Cited in
(29)- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- On the convergence analysis of arc search interior point methods for LCPs
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization
- Fuzzy support vector regressions for short-term load forecasting
- The arc-search interior-point algorithm
- Real‐time control of connected vehicles in signalized corridors using pseudospectral convex optimization
- A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
- An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones
- A mathematical programming model for computing the fries number of a fullerene
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
- On second-order conic programming duals for robust convex quadratic optimization problems
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
- An exterior point polynomial-time algorithm for convex quadratic programming
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
- A corrector-predictor arc search interior-point algorithm for symmetric optimization
This page was built for publication: A polynomial arc-search interior-point algorithm for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421610)
