Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 18
Volume 18, Number 1, 1980
- W. R. S. Sutherland:
Optimality in transient markov chains and linear programming. 1-6 - Johannes Bisschop, Alexander Meeraus:
Matrix augmentation and structure preservation in linearly constrained control problems. 7-15 - Richard S. Sacher:
A decomposition algorithm for quadratic programming. 16-30 - Donald Goldfarb:
Curvilinear path steplength algorithms for minimization which use directions of negative curvature. 31-40 - Quirino Paris:
Consistent aggregation of linear complementarity problems. 41-48 - Richard D. McBride:
A bump triangular dynamic factorization algorithm for the simplex method. 49-61 - Stanley J. Garstka:
An economic interpretation of stochastic programs. 62-67 - Dennis L. Bricker:
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual. 68-83 - Imre Bárány:
Borsuk's theorem through complementary pivoting. 84-88 - Mokhtar S. Bazaraa, C. M. Shetty, Jamie J. Goode:
On the convergence of a class of algorithms using linearly independent search directions. 89-93 - Manfred Padberg:
(1, k)-configurations and facets for packing problems. 94-99 - Van Hien Nguyen, Jean-Jacques Strodiot, Robert Mifflin:
On conditions to have bounded multipliers in locally lipschitz programming. 100-106 - Michael J. Todd:
A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization. 111-126 - Yow-Yieh Chang, Richard W. Cottle:
Least-index resolution of degeneracy in quadratic programming. 127-137 - Davis Avis:
A note on some computationally difficult set covering problems. 138-145 - Jan Eriksson:
A note on solution of large sparse maximum entropy problems with linear equality constraints. 146-154 - Hiroshi Yamashita:
A differential equation approach to nonlinear programming. 155-168 - Daniel Solow:
Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems. 169-185 - Ulrich Eckhardt:
Weber's problem and weiszfeld's algorithm in general spaces. 186-196 - Krisorn Jittorntrum:
Accelerated convergence for the Powell/Hestenes multiplier method. 197-214 - André F. Perold:
A generalization of the Frank - Wolfe theorem. 215-227 - Michael J. Todd:
Exploiting structure in piecewise-linear homotopy algorithms for solving equations. 233-247 - Ury Passy, Shaul Yutav:
Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints. 248-273 - Gerard van der Laan, A. J. J. Talman:
An improvement of fixed point algorithms by using a good triangulation. 274-285 - Daniel W. Litwhiler Jr., Adel A. Aly:
Steiner's problem and fagnano's result on the sphere. 286-290 - Roger Fletcher, G. Alistair Watson:
First and second order conditions for a class of nondifferentiable optimization problems. 291-307 - T. H. Mattheiss, Brian K. Schmidt:
Computational results on an algorithm for finding all vertices of a polytope. 308-329 - Jonathan M. Borwein
:
A note on perfect duality and limiting lagrangeans. 330-337 - Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
A polynomially bounded algorithm for a singly constrained quadratic program. 338-343 - Moshe Kress, Arie Tamir:
The use of jacobi's lemma in unimodularity theory. 344-348 - Jean-Pierre Crouzeix:
On second order conditions for quasiconvexity. 349-352
a service of 
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 2024-05-14 21:15 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:
