Pages that link to "Item:Q3824098"
From MaRDI portal
The following pages link to The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories (Q3824098):
Displaying 50 items.
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- A class of primal affine scaling algorithms (Q427024) (← links)
- A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← links)
- Legendre transform and applications to finite and infinite optimization (Q505632) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- The central curve in linear programming (Q695626) (← links)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163) (← links)
- On the asymptotic behavior of the projective rescaling algorithm for linear programming (Q750290) (← links)
- The relation between the path of centers and Smale's regularization of the linear programming problem (Q803732) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- Feasible region contraction interior point algorithm (Q858800) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory (Q927226) (← links)
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
- On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems (Q1029277) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- Interior path following primal-dual algorithms. I: Linear programming (Q1123121) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- Hamiltonian structure of dynamical systems which solve linear programming problems (Q1181368) (← links)
- Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
- Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
- Subgradient algorithm on Riemannian manifolds (Q1264990) (← links)
- The dynamics and internal geometry of the three-city noxious location problem (Q1310194) (← links)
- A simplified global convergence proof of the affine scaling algorithm (Q1312779) (← links)
- On the expected optimal value of random assignment problems: Experimental results and open questions (Q1315447) (← links)
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT (Q1316100) (← links)
- Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming (Q1325127) (← links)
- Stable barrier-projection and barrier-Newton methods in linear programming (Q1342880) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Monotone variable-metric algorithm for linearly constrained nonlinear programming (Q1579655) (← links)
- An application of the continuous time replicator dynamic to economics (Q1614004) (← links)
- Riemannian game dynamics (Q1622363) (← links)
- Image labeling by assignment (Q1702593) (← links)
- Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
- An optimization framework of biological dynamical systems (Q1794898) (← links)
- On the choice of parameters for power-series interior point algorithms in linear programming (Q1804368) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- A class of polynomial variable metric algorithms for linear optimization (Q1814798) (← links)
- An implementation of Karmarkar's algorithm for linear programming (Q1824551) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- Nonlinear coordinate representations of smooth optimization problems (Q1905043) (← links)
