Pages that link to "Item:Q1123121"

The following pages link to Interior path following primal-dual algorithms. I: Linear programming (Q1123121):

Displaying 27 items.

• Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
• (Q4577944) (← links)
• Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term (Q4596180) (← links)
• Calmness of partially perturbed linear systems with an application to the central path (Q4634160) (← links)
• Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term (Q4646520) (← links)
• A self-adjusting primal–dual interior point method for linear programs (Q4657821) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• An alternative derivation of the projective interior point method for linear programming through the least squares approach (Q4764596) (← links)
• A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada (Q4905610) (← links)
• A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
• A truncated primal-infeasible dual-feasible network interior point method (Q4953319) (← links)
• A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
• (Q5020878) (← links)
• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function (Q5089362) (← links)
• What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
• Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
• A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
• ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING (Q5315980) (← links)
• Properties Of Primal Interior Point Methods For QP^∗ (Q5689843) (← links)
• An interior point algorithm for convex quadratic programming with strict equilibrium constraints (Q5710540) (← links)
• The aggregate constraint homotopy method for nonconvex nonlinear programming (Q5946387) (← links)
• General central path and the largest step general central path following algorithm for linear programming (Q5949520) (← links)
• A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term (Q6046863) (← links)
• A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones (Q6161308) (← links)
• An efficient interior point method for linear optimization using modified Newton method (Q6547829) (← links)
• Multi-expansion modal reduction: a pragmatic semi-a priori model order reduction approach for nonlinear structural dynamics (Q6555355) (← links)
• Semi-definite programming and quantum information (Q6561827) (← links)