Pages that link to "Item:Q4016916"
From MaRDI portal
The following pages link to Path-Following Methods for Linear Programming (Q4016916):
Displayed 50 items.
- An infeasible-start path-following method for monotone LCPs (Q597439) (← 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)
- 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)
- 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)
- An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method (Q1610185) (← links)
- Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
- On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method (Q1816897) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- The Newton modified barrier method for QP problems (Q1915923) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)