Journals in DBLP
David S. Atkinson , Pravin M. Vaidya A cutting plane algorithm for convex programming that uses analytic centers. [Citation Graph (0, 0)][DBLP ] Journal ] O. Bahn , O. Du Merle , Jean-Louis Goffin , Jean-Philippe Vial A cutting plane method from analytic centers for stochastic programming. [Citation Graph (0, 0)][DBLP ] Journal ] Dick den Hertog , Florian Jarre , Kees Roos , Tamás Terlaky A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. [Citation Graph (0, 0)][DBLP ] Journal ] Krzysztof C. Kiwiel Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. [Citation Graph (0, 0)][DBLP ] Journal ] Claude Lemaréchal , Arkadii Nemirovskii , Yurii Nesterov New variants of bundle methods. [Citation Graph (0, 0)][DBLP ] Journal ] Yurii Nesterov Complexity estimates of some cutting plane methods based on the analytic barrier. [Citation Graph (0, 0)][DBLP ] Journal ] Yurii Nesterov , A. S. Nemirovskii An interior-point method for generalized linear-fractional programming. [Citation Graph (0, 0)][DBLP ] Journal ] Lieven Vandenberghe , Stephen P. Boyd A primal-dual potential reduction method for problems involving matrix inequalities. [Citation Graph (0, 0)][DBLP ] Journal ] Bintong Chen , Patrick T. Harker A continuation method for monotone variational inequalities. [Citation Graph (0, 0)][DBLP ] Journal ] Aniekan Ebiefung Nonlinear mappings associated with the generalized linear complementarity problem. [Citation Graph (0, 0)][DBLP ] Journal ] Dorit S. Hochbaum , Sung-Pil Hong About strongly polynomial time algorithms for quadratic optimization over submodular constraints. [Citation Graph (0, 0)][DBLP ] Journal ] Renato D. C. Monteiro , Stephen J. Wright Superlinear primal-dual affine scaling algorithms for LCP. [Citation Graph (0, 0)][DBLP ] Journal ] Michel X. Goemans Worst-case comparison of valid inequalities for the TSP. [Citation Graph (0, 0)][DBLP ] Journal ] Jianming Miao A quadratically convergent O((k+1)root(n)L)-iteration algorithm for the P(k)-matrix linear complementarity problem. [Citation Graph (0, 0)][DBLP ] Journal ] Sridhar Tayur , Rekha R. Thomas , N. R. Natraj An algebraic geometry algorithm for scheduling in presence of setups and correlated demands. [Citation Graph (0, 0)][DBLP ] Journal ] Jia-Ming Cao Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs. [Citation Graph (0, 0)][DBLP ] Journal ] Steef L. van de Velde Dual decomposition of a single-machine scheduling problem. [Citation Graph (0, 0)][DBLP ] Journal ] Mihir Bellare , Phillip Rogaway The complexity of approximating a nonlinear program. [Citation Graph (0, 0)][DBLP ] Journal ] Zelda B. Zabinsky , G. R. Wood , Mike A. Steel , William Baritompa Pure adaptive search for finite global optimization. [Citation Graph (0, 0)][DBLP ] Journal ] Alexander I. Barvinok New algorithms for linear k-matroid intersection and matroid k-parity problems. [Citation Graph (0, 0)][DBLP ] Journal ] Herbert Hamers , Peter Borm , Stef Tijs On games corresponding to sequencing situations with ready times. [Citation Graph (0, 0)][DBLP ] Journal ] 