Pages that link to "Item:Q1123122"
From MaRDI portal
The following pages link to Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122):
Displaying 50 items.
- On the closest point to the origin in transportation polytopes (Q299056) (← links)
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- An interior-exterior approach for convex quadratic programming (Q436003) (← links)
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
- Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization (Q462993) (← links)
- On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Analytic center of spherical shells and its application to analytic center machine (Q839678) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- Solving some optimal control problems using the barrier penalty function method (Q1187560) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- Finding the closest point to the origin in the convex hull of a discrete set of points (Q1260737) (← links)
- Cost-effective sulphur emission reduction under uncertainty (Q1268422) (← links)
- A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
- Investigation of path-following algorithms for signomial geometric programming problems (Q1280139) (← links)
- Computing Karmarkar's projections in stochastic linear programming (Q1288215) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- Steplengths in interior-point algorithms of quadratic programming (Q1306349) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- A multiobjective interior primal-dual linear programming algorithm (Q1318462) (← links)
- Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← 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)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
