Works matching IS 00255610 AND DT 1999 AND VI 86 AND IP 3

Results: 11

Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 615, doi. 10.1007/s101070050107

By:

Heinkenschloss, Matthias;
Ulbrich, Michael;
Ulbrich, Stefan

Publication type:

Article

Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 637, doi. 10.1007/s101070050108

By:

Mohan, S.R.;
Neogy, S.K.;
Parthasarathy, T.;
Sinha, S.

Publication type:

Article

Properties of an interior embedding for solving nonlinear optimization problems.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 649

By:

Gómez Bofill, Walter

Publication type:

Article

Hit-and-run mixes fast.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 443

By:

Lovász, László

Publication type:

Article

On maximization of quadratic form over intersection of ellipsoids with common center.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 463, doi. 10.1007/s101070050100

By:

Nemirovski, A.;
Roos, C.;
Terlaky, T.

Publication type:

Article

Feasible descent algorithms for mixed complementarity problems.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 475, doi. 10.1007/s101070050101

By:

Ferris, Michael C.;
Kanzow, Christian;
Munson, Todd S.

Publication type:

Article

A new bound for the ratio between the 2-matching problem and its linear programming relaxation.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 499, doi. 10.1007/s101079900102

By:

Boyd, Sylvia;
Carr, Robert

Publication type:

Article

A branch-and-cut method for 0-1 mixed convex programming.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 515, doi. 10.1007/s101070050103

By:

Stubbs, Robert A.;
Mehrotra, Sanjay

Publication type:

Article

A non-interior continuation method for generalized linear complementarity problems.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 533, doi. 10.1007/s101070050104

By:

Peng, Ji-Ming;
Lin, Zhenghua

Publication type:

Article

Computational study of a column generation algorithm for bin packing and cutting stock problems.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 565, doi. 10.1007/s101070050105

By:

Vanderbeck, Francois

Publication type:

Article

Convex programming for disjunctive convex optimization.

Published in:

Mathematical Programming, 1999, v. 86, n. 3, p. 595, doi. 10.1007/s101070050106

By:

Ceria, Sebastián;
Soares, João

Publication type:

Article