default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 35
Volume 35, Number 1, May 1986
- Michael J. Todd:
From the editor. 1-2 - Martin E. Dyer
, Alan M. Frieze, Colin J. H. McDiarmid:
On linear programs with random costs. 3-16 - John T. Fredricksen, Layne T. Watson, Katta G. Murty:
A finite characterization ofK-matrices in dimensions less than four. 17-31 - Richard H. Byrd, Robert B. Schnabel:
Continuity of the null space basis and constrained optimization. 32-41 - Jean-Pierre Crouzeix, Per Olov Lindberg:
Additively decomposed quasiconvex functions. 42-57 - Masao Fukushima:
A relaxed projection method for variational inequalities. 58-70 - Ekkehard W. Sachs:
Broyden's method in Hilbert space. 71-82 - Jonathan M. Borwein, Henry Wolkowicz:
A simple constraint qualification in infinite dimensional programming. 83-96 - John L. Nazareth:
The method of successive affine reduction for nonlinear minimization. 97-109 - Jacques Guélat, Patrice Marcotte:
Some comments on Wolfe's 'away step'. 110-119
Volume 35, Number 2, June 1986
- Sancho E. Berenguer, Robert L. Smith:
The expected number of extreme points of a random linear program. 129-134 - Charles E. Blair:
Random inequality constraint systems with few variables. 135-139 - Nimrod Megiddo:
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm. 140-172 - Michael J. Todd:
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems. 173-192 - Craig A. Tovey:
Low order polynomial bounds on the expected performance of local improvement algorithms. 193-224 - Nimrod Megiddo:
On the expected number of linear complementarity cones intersected by random and semi-random rays. 225-235 - Yieh-Hei Wan:
On the average speed of Lemke's algorithm for quadratic programming. 236-246
Volume 35, Number 3, July 1986
- Masao Fukushima:
A successive quadratic programming algorithm with global and superlinear convergence properties. 253-264 - M. J. D. Powell, Ya-Xiang Yuan:
A recursive quadratic programming algorithm that uses differentiable exact penalty functions. 265-278 - Suvrajeet Sen, Hanif D. Sherali:
A class of convergent primal-dual subgradient algorithms for decomposable convex programs. 279-297 - Satoru Fujishige:
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm. 298-308 - Andrzej Ruszczynski:
A regularized decomposition method for minimizing a sum of polyhedral functions. 309-333 - Rafael Lazimy:
Solving multiple criteria problems by interactive decomposition. 334-361 - Michel L. Balinski, Thomas M. Liebling, A.-E. Nobs:
On the average length of lexicographic paths. 362-364 - Nimrod Megiddo:
A note on degeneracy in linear programming. 365-367 - Sanjo Zlobec:
Characterizing an optimal input in perturbed convex programming: Corrigendum. 368-371
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-11-28 23:55 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:
