An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
From MaRDI portal
Publication:2674577
DOI10.1007/s11075-022-01279-xzbMath1501.65022OpenAlexW4220695169MaRDI QIDQ2674577
Publication date: 14 September 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01279-x
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A polynomial arc-search interior-point algorithm for linear programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Convergence behavior of interior-point algorithms
- Computational experience with a primal-dual interior point method for linear programming
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- 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
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Arc-Search Techniques for Interior-Point Methods
