default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 69
Volume 69, 1995
- David S. Atkinson, Pravin M. Vaidya:
A cutting plane algorithm for convex programming that uses analytic centers. 1-43 - Olivier Bahn, Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial:
A cutting plane method from analytic centers for stochastic programming. 45-73 - 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. 75-88 - Krzysztof C. Kiwiel:
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. 89-109 - Claude Lemaréchal, Arkadii Nemirovskii, Yurii E. Nesterov:
New variants of bundle methods. 111-147 - Yurii E. Nesterov:
Complexity estimates of some cutting plane methods based on the analytic barrier. 149-176 - Yurii E. Nesterov, A. S. Nemirovskii:
An interior-point method for generalized linear-fractional programming. 177-204 - Lieven Vandenberghe, Stephen P. Boyd:
A primal-dual potential reduction method for problems involving matrix inequalities. 205-236 - Bintong Chen, Patrick T. Harker:
A continuation method for monotone variational inequalities. 237-253 - Aniekan Ebiefung:
Nonlinear mappings associated with the generalized linear complementarity problem. 255-268 - Dorit S. Hochbaum, Sung-Pil Hong:
About strongly polynomial time algorithms for quadratic optimization over submodular constraints. 269-309 - Renato D. C. Monteiro, Stephen J. Wright:
Superlinear primal-dual affine scaling algorithms for LCP. 311-333 - Michel X. Goemans:
Worst-case comparison of valid inequalities for the TSP. 335-349 - Jianming Miao:
A quadratically convergent O((k+1)root(n)L)-iteration algorithm for the P(k)-matrix linear complementarity problem. 355-368 - Sridhar R. Tayur, Rekha R. Thomas, N. R. Natraj:
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands. 369-401 - Jia-Ming Cao:
Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs. 403-411 - Steef L. van de Velde:
Dual decomposition of a single-machine scheduling problem. 413-428 - Mihir Bellare, Phillip Rogaway:
The complexity of approximating a nonlinear program. 429-441 - Zelda B. Zabinsky, Graham R. Wood, Mike A. Steel, William Baritompa:
Pure adaptive search for finite global optimization. 443-448 - Alexander I. Barvinok:
New algorithms for linear k-matroid intersection and matroid k-parity problems. 449-470 - Herbert Hamers, Peter Borm, Stef Tijs:
On games corresponding to sequencing situations with ready times. 471-483
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
