Pages that link to "Item:Q4016916"

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

Displaying 50 items.

• Crash start of interior point methods (Q323526) (← links)
• Dual convergence for penalty algorithms in convex programming (Q430935) (← links)
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
• An interior-exterior approach for convex quadratic programming (Q436003) (← links)
• A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems (Q436728) (← links)
• Stochastic robustness metric and its use for static resource allocations (Q436874) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization (Q462993) (← links)
• Path following in the exact penalty method of convex programming (Q493687) (← links)
• An infeasible-start path-following method for monotone LCPs (Q597439) (← links)
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
• Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems (Q715082) (← links)
• An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
• The relation between the path of centers and Smale's regularization of the linear programming problem (Q803732) (← links)
• A numerical study of an infeasible primal-dual path-following algorithm for linear programming (Q884611) (← 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)
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
• Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
• New theoretical results on recursive quadratic programming algorithms (Q1265011) (← links)
• A new neural network for solving linear programming problems (Q1268155) (← links)
• Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
• Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
• The role of the augmented system in interior point methods (Q1296137) (← 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)
• Modified predictor-corrector algorithm for locating weighted centers in linear programming (Q1321467) (← links)
• Controlled dual perturbations for central path trajectories in geometric programming (Q1328646) (← links)
• Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
• Asymptotic analysis of the exponential penalty trajectory in linear programming (Q1341567) (← links)
• Some properties of the Hessian of the logarithmic barrier function (Q1341572) (← links)
• Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
• A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
• Potential-reduction methods in mathematical programming (Q1361104) (← links)
• Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
• Volumetric path following algorithms for linear programming (Q1361113) (← links)
• Fast Cholesky factorization for interior point methods of linear programming (Q1361270) (← links)
• The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case (Q1372556) (← links)
• A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
• Coupling the proximal point algorithm with approximation methods (Q1379933) (← links)
• Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics (Q1574221) (← links)
• Symbiosis between linear algebra and optimization (Q1591197) (← links)
• The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
• An interactive interior point algorithm for multiobjective linear programming problems (Q1604044) (← links)