Pages that link to "Item:Q2368076"

The following pages link to A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076):

Displaying 41 items.

• Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model (Q297075) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity (Q410785) (← links)
• Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
• Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory (Q927226) (← links)
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
• On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems (Q1029277) (← links)
• A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
• Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
• Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
• Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
• A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
• Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
• The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
• Predictor-corrector method for nonlinear complementarity problems (Q1387608) (← links)
• Interior-point methods (Q1593831) (← links)
• A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
• On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652) (← links)
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path (Q1848380) (← links)
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
• Solving linear systems involved in constrained optimization (Q1902118) (← links)
• The curvature integral and the complexity of linear complementarity problems (Q1904662) (← links)
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
• Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
• A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
• On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
• A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)