An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
From MaRDI portal
Publication:6541376
Recommendations
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- The arc-search interior-point algorithm
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- A polynomial arc-search interior-point algorithm for convex quadratic programming
Cites work
- A note on performance profiles for benchmarking software
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- 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
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- Arc-search techniques for interior-point methods
- Benchmarking optimization software with performance profiles.
- Further development of multiple centrality correctors for interior point methods
- Generalized affine scaling algorithms for linear programming problems
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Multiple centrality corrections in a primal-dual method for linear programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- Optimized choice of parameters in interior-point methods for linear programming
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
This page was built for publication: An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541376)
