Pages that link to "Item:Q1108927"
From MaRDI portal
The following pages link to A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927):
Displaying 50 items.
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- Identifying an optimal basis in linear programming (Q1915926) (← links)
- A new algorithm for minimizing convex functions over convex sets (Q1918926) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- On polynomiality of the method of analytic centers for fractional problems (Q1919100) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- General equilibrium models and homotopy methods (Q1960548) (← links)
- A direct heuristic algorithm for linear programming (Q1971659) (← links)
- Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme (Q2070401) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems (Q2276890) (← links)
- On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
- Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method (Q2337073) (← links)
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era (Q2390176) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
- Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- An exterior-point method for linear programming problems (Q2564164) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- Search directions for interior linear-programming methods (Q2639771) (← links)
- Intersecting restrictions in clutters (Q2658378) (← links)
- Removing algorithmic discrimination (with minimal individual error) (Q2672613) (← links)
- An interior-point algorithm for the minimization arising from 3D contact problems with friction (Q2867430) (← links)
- Men and progress in linear programming (Q3089104) (← links)
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
- El metodo de Karmarkar: Un estudio de sus variantes (Q3360002) (← links)
- On Chubanov’s Method for Solving a Homogeneous Inequality System (Q3462316) (← links)
- Solving Simple Stochastic Games (Q3507435) (← links)
- A family of linear programming algorithms based on an algorithm by von Neumann (Q3632946) (← links)
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (Q3780756) (← links)
- Solving a linear multiperiod portfolio problem by interior-point methodology (Q4022782) (← links)
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS (Q4548041) (← links)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- Calmness of partially perturbed linear systems with an application to the central path (Q4634160) (← links)
- An improved version of Chubanov's method for solving a homogeneous feasibility problem (Q4638910) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- (Q4735034) (← links)
