Pages that link to "Item:Q4016916"

The following pages link to Path-Following Methods for Linear Programming (Q4016916):

Displaying 19 items.

• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• The interior-point revolution in optimization: History, recent developments, and lasting consequences (Q4829921) (← links)
• On Long Step Path Following and SUMT for Linear and Quadratic Programming (Q4877504) (← links)
• Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods (Q4916327) (← links)
• AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS (Q5035348) (← links)
• Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
• Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
• A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function (Q5356999) (← links)
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
• On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method (Q5689973) (← links)
• An interior point algorithm for convex quadratic programming with strict equilibrium constraints (Q5710540) (← links)
• Two simple proofs for analyticity of the central path in linear programming. (Q5937499) (← 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)
• Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity (Q6084542) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
• A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
• IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga (Q6195051) (← links)
• Set-limited functions and polynomial-time interior-point methods (Q6596326) (← links)