default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 27
Volume 27, Number 1, September 1983
- Donald Goldfarb, Ashok U. Idnani:
A numerically stable dual method for solving strictly convex quadratic programs. 1-33 - Michael L. Overton:
A quadratically convergent method for minimizing a sum of euclidean norms. 34-63 - Ronald D. Armstrong, Philip O. Beck:
The best parameter subset using the Chebychev curve fitting criterion. 64-74 - Dennis F. Karney:
A duality theorem for semi-infinite convex programs and their finite subprograms. 75-82 - Joseph G. Ecker
, Michael Kupferschmid:
An ellipsoid algorithm for nonlinear programming. 83-106 - Dimitri P. Bertsekas:
Distributed asynchronous computation of fixed points. 107-120
Volume 27, Number 2, October 1983
- Renpu Ge, M. J. D. Powell:
The convergence of variable metric matrices in unconstrained optimization. 123-143 - Robert G. Jeroslow:
Uniform duality in semi-infinite convex optimization. 144-154 - Albert G. Buckley, A. LeNir:
QN-like variable storage conjugate gradients. 155-175 - Trond Steihaug:
Local and superlinear convergence for truncated iterated projections methods. 176-190 - Richard W. Cottle, Richard E. Stone:
On the uniqueness of solutions to linear complementarity problems. 191-213 - James B. Orlin:
Maximum-throughput dynamic network flows. 214-231 - John A. Tomlin, J. S. Welch:
Formal optimization of some reduced linear programming problems. 232-240
Volume 27, Number 3, October 1983
- Steve Smale:
On the average number of steps of the simplex method of linear programming. 241-262 - C. B. García, Floyd J. Gould:
An application of homotopy to solving linear programs. 263-282 - James K. Ho, Etienne Loute:
Computational experience with advanced implementation of decomposition algorithms for linear programming. 283-290 - Manfred von Golitschek, Uriel G. Rothblum, Hans Schneider:
A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds. 291-306 - Marco A. López, Enriqueta Vercher:
Optimality conditions for nondifferentiable convex semi-infinite programming. 307-319 - Krzysztof C. Kiwiel:
An aggregate subgradient method for nonsmooth convex minimization. 320-341 - Jean-Pierre Crouzeix, Jacques A. Ferland, Siegfried Schaible:
Duality in generalized linear fractional programming. 342-354 - Martin E. Dyer, John Walker:
A note on bicriterion programming. 355-361
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-04 23:29 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:
