A polynomial arc-search interior-point algorithm for convex quadratic programming
From MaRDI portal
Publication:421610
DOI10.1016/j.ejor.2011.06.020zbMath1252.90059MaRDI QIDQ421610
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.020
Related Items
A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs, An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones, Real‐time control of connected vehicles in signalized corridors using pseudospectral convex optimization, On second-order conic programming duals for robust convex quadratic optimization problems, A polynomial time infeasible interior-point arc-search algorithm for convex optimization, A wide neighborhood infeasible-interior-point method with arc-search for linear programming, A polynomial arc-search interior-point algorithm for linear programming, A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem, An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, On the extension of an arc-search interior-point algorithm for semidefinite optimization, An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, An infeasible interior-point arc-search algorithm for nonlinear constrained optimization, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, A mathematical programming model for computing the fries number of a fullerene, A primal-dual interior-point algorithm with arc-search for semidefinite programming, A corrector-predictor arc search interior-point algorithm for symmetric optimization, On the convergence analysis of arc search interior point methods for LCPs, An exterior point polynomial-time algorithm for convex quadratic programming, 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 efficient arc-search interior-point algorithm for convex quadratic programming with box constraints, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence behavior of interior-point algorithms
- A new polynomial-time algorithm for linear programming
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Test examples for nonlinear programming codes
- Multiple centrality corrections in a primal-dual method for linear programming
- Algorithm 915, SuiteSparseQR
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- On the Implementation of a Primal-Dual Interior Point Method
- Numerical Optimization
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- LOQO:an interior point code for quadratic programming
