An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
From MaRDI portal
Publication:2674577
Recommendations
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints
- scientific article; zbMATH DE number 1526956
- A polynomial arc-search interior-point algorithm for convex quadratic programming
Cites work
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- 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
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- Arc-search techniques for interior-point methods
- Computational experience with a primal-dual interior point method for linear programming
- Convergence behavior of interior-point algorithms
- Handbook of mathematics for engineers and scientists
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 4199975 (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 964349 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Cited in
(7)- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- scientific article; zbMATH DE number 4199975 (Why is no real title available?)
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- scientific article; zbMATH DE number 1526956 (Why is no real title available?)
- Constrained LQR Design Using Interior-Point Arc-Search Method for Convex Quadratic Programming with Box Constraints
This page was built for publication: An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674577)
