default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 9
Volume 9, Number 1, 1975
- William C. Davidon:
Optimally conditioned optimization algorithms without line searches. 1-30 - Eugene L. Lawler:
Matroid intersection algorithms. 31-56 - J. J. McKeown:
Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms. 57-68 - Melanie L. Lenard:
Practical convergence conditions for the Davidon-Fletcher-Powell method. 69-86 - Dimitri P. Bertsekas:
Necessary and sufficient conditions for a penalty method to be exact. 87-99 - Robert Mifflin:
A superlinearly convergent algorithm for minimization without evaluating derivatives. 100-117 - Jacob Ponstein, Willem K. Klein Haneveld:
On a general saddle-point condition in normed spaces. 118-122 - C. N. Beer, B. L. Foote:
A procedure to rank bases by probability of being optimal using imbedded hyperspheres. 123-128 - Michael J. Best:
A method to accelerate the rate of convergence of a class of optimization algorithms. 139-160 - Fred W. Glover:
Polyhedral annexation in mixed integer and combinatorial programming. 161-188 - Balder Von Hohenbalken:
A finite algorithm to maximize certain pseudoconcave functions on polytopes. 189-206 - Jack E. Graver:
On the foundations of linear and integer linear programming I. 207-226 - C. B. García:
A fixed point theorem including the last theorem of Poincaré. 227-239 - David Sankoff, Pascale Rousseau:
Locating the vertices of a steiner tree in an arbitrary metric space. 240-246 - Richard H. Byrd, Richard A. Tapia:
An extension of Curry's theorem to steepest descent in normed linear spaces. 247-254 - Masakazu Kojima:
A unification of the existence theorems of the nonlinear complementarity problem. 257-277 - Hans-Jakob Lüthi:
A simplicial approximation of a solution for the nonlinear complementarity problem. 278-293 - R. D. Young:
The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques. 294-312 - Josef Stoer:
On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class. 313-335 - H. Mukai, Elijah Polak:
A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints. 336-349 - Hartmut Noltemeier:
An algorithm for the determination of longest distances in a graph. 350-357 - Guillermo Owen:
On the core of linear production games. 358-370 - Robert G. Jeroslow, T. H. C. Smith:
Experimental results on Hillier's linear search. 371-376
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-04-27 18:05 CEST 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:
