Find link

language:

Find link is a tool written by Edward Betts.

searching for Interior-point method 10 found (45 total)

Galahad library (384 words) [view diff] exact match in snippet view article find links to article

active-set method for nonconvex quadratic programming, a primal-dual interior-point method for nonconvex quadratic programming, a presolver for quadratic programs

ABS methods (602 words) [view diff] no match in snippet view article find links to article

classical ones, especially for the problem arising in primal-dual interior point method; ABS methods are usually faster on vector or parallel machines;

APOPT (383 words) [view diff] no match in snippet view article find links to article

and MINOS. A combination of APOPT (Active Set SQP) and BPOPT (Interior Point Method) performed the best on 494 benchmark problems for solution speed

MOSEK (376 words) [view diff] exact match in snippet view article find links to article

Andersen, C. Roos, and T. Terlaky. On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Programming, 95(2), February

Venansius Baryamureeba (1,581 words) [view diff] no match in snippet view article find links to article

Steihaug, Trond (2006). "On the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programming". Large-Scale Scientific Computing. Lecture

Robert Fourer (360 words) [view diff] exact match in snippet view article find links to article

Mehrotra, Sanjay (1993). "Solving symmetric indefinite systems in an interior-point method for linear programming". Mathematical Programming. 62 (1–3): 15–39

University of California, Berkeley (16,240 words) [view diff] no match in snippet view article find links to article

molecular origin. Narendra Karmarkar (PhD 1983) is known for the interior point method, a polynomial algorithm for linear programming known as Karmarkar's

California Institute of Technology (15,229 words) [view diff] no match in snippet view article find links to article

investigations of polynomials. Narendra Karmarkar (MS 1979) is known for the interior point method, a polynomial algorithm for linear programming known as Karmarkar's

Maximum flow problem (5,227 words) [view diff] no match in snippet view article find links to article

maintaining the augmenting electrical flows at the core of the interior point method based algorithm from [Mądry JACM ‘16]. This entails designing data

Edward Y. Chang (2,595 words) [view diff] no match in snippet view article find links to article

matrix factorization can be used to distribute the solver of the Interior Point Method across multiple machines, while utilizing a row-based Incomplete