Works matching IS 00255610 AND DT 2003 AND VI 96 AND IP 1

Results: 7

A practical general approximation criterion for methods of multipliers based on Bregman distances.

Published in:

Mathematical Programming, 2003, v. 96, n. 1, p. 61, doi. 10.1007/s10107-003-0374-x

By:

Eckstein, Jonathan

Publication type:

Article

The mixed general routing polyhedron.

Published in:

Mathematical Programming, 2003, v. 96, n. 1, p. 103

By:

Corberán, A.;
Romero, A.;
Sanchis, J.M.

Publication type:

Article

Logic-based Benders decomposition.

Published in:

Mathematical Programming, 2003, v. 96, n. 1, p. 33, doi. 10.1007/s10107-003-0375-9

By:

Hooker, J.N.;
Ottosson, G.

Publication type:

Article

A nonlinear programming algorithm based on non-coercive penalty functions.

Published in:

Mathematical Programming, 2003, v. 96, n. 1, p. 87, doi. 10.1007/s10107-002-0332-z

By:

Gonzaga, Clovis C.;
Castillo, Rómulo A.

Publication type:

Article

A likelihood-MPEC approach to target classification.

Published in:

Mathematical Programming, 2003, v. 96, n. 1, p. 1, doi. 10.1007/s10107-003-0242-8

By:

Olson, Tim;
Pang, Jong-Shi;
Priebe, Carey

Publication type:

Article

On the global convergence of an SLP–filter algorithm that takes EQP steps.

Published in:

Mathematical Programming, 2003, v. 96, n. 1, p. 161, doi. 10.1007/s10107-003-0378-6

By:

Chin, Choong Ming;
Fletcher, Roger

Publication type:

Article

Multiobjective optimization problem with variational inequality constraints.

Published in:

Mathematical Programming, 2003, v. 96, n. 1, p. 139, doi. 10.1007/s10107-002-0365-3

By:

Ye, J.J.;
Zhu, Qiji J.

Publication type:

Article