Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems Kurt M. AnstreicherMarcia FampaJoy Williams Pages: 221 - 240
A bundle Bregman proximal method for convex nondifferentiable minimization Krzysztof C. Kiwiel Pages: 241 - 258
Q-matrix recognition via secondary and universal polytopes Jesús A. De LoeraWalter D. Morris jr. Pages: 259 - 276
Proximal quasi-Newton methods for nondifferentiable convex optimization Xiaojun ChenMasao Fukushima Pages: 313 - 334
Partition polytopes over 1-dimensional points Biao GaoFrank K. HwangUriel G. Rothblum Pages: 335 - 362
Tight representation of logical constraints as cardinality rules Hong YanJ. N. Hooker Pages: 363 - 377
Random Linkage: a family of acceptance/rejection algorithms for global optimisation Marco LocatelliFabio Schoen Pages: 379 - 396
Stability of solutions to parameterized nonlinear complementarity problems A.B. Levy Pages: 397 - 406
Testing optimality for quadratic 0-1 problems Paolo CarraresiFernanda FarinaccioFederico Malucelli Pages: 407 - 421
Robustness of posynomial geometric programming optima A.J. FederowiczJayant Rajgopal Pages: 423 - 431
A note on the convergence of barrier algorithms to second-order necessary points Nicholas I. M. GouldPhilippe L. Toint Pages: 433 - 438