The following pages link to Interior-point methods (Q1593831):
Displayed 11 items.
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
- Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
- A non-interior-point smoothing method for variational inequality problem (Q966082) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- Performance bounds for linear stochastic control (Q1016592) (← links)
- The Kantorovich theorem and interior point methods (Q1769068) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- Spectral radius minimization for optimal average consensus and output feedback stabilization (Q2391321) (← links)