Pages that link to "Item:Q4018396"

The following pages link to On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms (Q4018396):

Displaying 30 items.

• Convergence behavior of interior-point algorithms (Q689124) (← links)
• Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
• Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
• Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems (Q1265014) (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
• Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
• Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
• Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization (Q1363416) (← links)
• Linear programming with stochastic elements: An on-line approach (Q1368447) (← links)
• A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
• Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
• On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
• Primal-dual Newton-type interior-point method for topology optimization (Q1862194) (← links)
• Inexact primal-dual interior point iteration for linear programs in function spaces (Q1892594) (← links)
• A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
• On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
• Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme (Q2070401) (← links)
• On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
• Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming (Q2719236) (← links)
• Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (Q3465241) (← links)
• On interior-point Newton algorithms for discretized optimal control problems with state constraints^∗ (Q3839448) (← links)
• Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
• A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)