Pages that link to "Item:Q1890928"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928):

Displaying 46 items.

An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (Q279835) (← links)
A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311) (← links)
Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization (Q1646672) (← links)
A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems (Q2067705) (← links)
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood (Q2221151) (← links)
A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← links)
On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← links)
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming (Q2921914) (← links)
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
Solving large-scale linear programs by interior-point methods under the Matlab∗Environment† (Q4227923) (← links)
User'S guide To Lipsol linear-programming interior point solvers V0.4 (Q4504786) (← links)
A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization (Q4633251) (← links)
Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones (Q4979787) (← links)
A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood (Q5031228) (← links)
Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones (Q5248204) (← links)
A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm (Q5317499) (← links)
A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function (Q6158944) (← links)