Pages that link to "Item:Q4286944"

The following pages link to On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming (Q4286944):

Displaying 50 items.

• A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
• 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)
• 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)
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity (Q410785) (← links)
• A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
• A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
• Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← links)
• Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
• Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
• Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
• On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
• Convergence behavior of interior-point algorithms (Q689124) (← links)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← 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 new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
• Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
• A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms (Q930345) (← links)
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
• Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
• Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999) (← links)
• On the long-step path-following method for semidefinite programming (Q1273093) (← links)
• Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
• Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
• Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
• Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
• A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
• An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
• A modified predictor-corrector method for linear programming (Q1318279) (← 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)
• Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176) (← links)
• Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← links)
• Modified predictor-corrector algorithm for locating weighted centers in linear programming (Q1321467) (← links)
• A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
• Local convergence of interior-point algorithms for degenerate monotone LCP (Q1326510) (← links)