swMATH19641MaRDI QIDQ31466FDOQ31466
Author name not available (Why is that?)
Official website: http://link.springer.com/article/10.1007%2Fs11075-016-0180-1
Cited In (13)
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- BenchmarkProfiles.jl
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
- 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
- Netlib
- LIPSOL
- ipfilter
- PCx
- QSDP
- 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
This page was built for software: CurveLP
