1 | -- | 13 | Nan Kong, Andrew J. Schaefer, Shabbir Ahmed. Totally unimodular stochastic programs |
15 | -- | 42 | Peter W. Glynn, Gerd Infanger. Simulation-based confidence bounds for two-stage stochastic programs |
43 | -- | 82 | David Hartvigsen, Yanjun Li. Polyhedron of triangle-free simple 2-matchings in subcubic graphs |
83 | -- | 114 | Anton Schiela. An interior point method in function space for the efficient solution of state constrained optimal control problems |
115 | -- | 139 | Guanghui Lan, Renato D. C. Monteiro. Iteration-complexity of first-order penalty methods for convex programming |
141 | -- | 166 | Clovis C. Gonzaga, Elizabeth W. Karas. Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming |
167 | -- | 198 | Vincent Guigues, Claudia A. Sagastizábal. Risk-averse feasible policies for large-scale multistage stochastic linear programs |
199 | -- | 221 | Bernard Fortz, Martine Labbé, François V. Louveaux, Michael Poss. Stochastic binary problems with simple penalties for capacity constraints violations |
223 | -- | 251 | Darinka Dentcheva, Gabriela Martinez. Regularization methods for optimization problems with probabilistic constraints |
253 | -- | 272 | Burhaneddin Sandikçi, Nan Kong, Andrew J. Schaefer. A hierarchy of bounds for stochastic mixed-integer programs |
273 | -- | 307 | Sangho Shim, Ellis L. Johnson. Cyclic group blocking polyhedra |
309 | -- | 332 | Gemayqzel Bouza Allende, Georg Still. Solving bilevel programs with the KKT-approach |
333 | -- | 364 | Masakazu Kojima, Makoto Yamashita. Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization |
365 | -- | 400 | Immanuel M. Bomze, Gabriele Eichfelder. Copositivity detection by difference-of-convex decomposition and ω-subdivision |
401 | -- | 445 | J. William Helton, Igor Klep, Scott A. McCullough. The matricial relaxation of a linear matrix inequality |
447 | -- | 473 | Stephan Dempe, Alain B. Zemkoho. The bilevel programming problem: reformulations, constraint qualifications and optimality conditions |
475 | -- | 500 | M. J. D. Powell. Beyond symmetric Broyden for updating quadratic models in minimization without derivatives |
501 | -- | 530 | Yu-Hong Dai. A perfect example for the BFGS method |
531 | -- | 577 | Mohit Tawarmalani, Jean-Philippe P. Richard, Chuanhui Xiong. Explicit convex and concave envelopes through polyhedral subdivisions |
579 | -- | 606 | Xiaojun Chen 0001, Shuhuang Xiang. Newton iterations in implicit time-stepping scheme for differential linear complementarity systems |