ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (15,805)
  • Springer  (15,805)
  • American Chemical Society (ACS)
  • 1990-1994  (10,073)
  • 1980-1984  (2,863)
  • 1970-1974  (2,869)
  • Computer Science  (15,805)
Collection
  • Articles  (15,805)
Source
Keywords
Publisher
Years
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Some recent results inn-person game theory (1971)
    Springer
    Mathematical programming 1 (1971), S. 58-67 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The discussion will center mainly on some work on two solution concepts: the core for gaines without side payments and the nucleolus for games with side payments (characteristic funtion games). The core has become an important equilibrium concept in mathematical economics. The nucleolus is related to the theory of bargaining sets.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584072
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Publications (1971)
    Springer
    Mathematical programming 1 (1971), S. 117-120 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584078
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The Mathematical Programming Society (1971)
    Springer
    Mathematical programming 1 (1971), S. 123-125 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584080
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Hybrid programs: Linear and least-distance (1971)
    Springer
    Mathematical programming 1 (1971), S. 153-167 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider a quadratic program equivalent to the general problem of minimizing a convex quadratic function of many variables subject to linear inequality constraints. In previous work [12], one of us presented an algorithm related to such problems, and classified them under “combinatorial equivalence”. The classification contained linear programs at one end (where the function has zero quadratic part) and least-distance programs at the other. A least-distance program is a problem of finding a point of a convex polyhedron which is at least distance from a given point; such programs have been studied by one of us [15, 17] and were shown to correspond to that case of the general problem where the function has positive definite quadratic part. We now extend the work on least-distance programs to those programs intermediate between linear and least-distance (called “essentially bisymmetric” in [12]), and show that such programs are really “hybrids”, with traits inherited from both parent programs: linear and leastdistance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584084
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    An “out-of-kilter” algorithm for solving minimum cost potential problems (1971)
    Springer
    Mathematical programming 1 (1971), S. 275-290 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm is given for solving the optimum potential problem, which is the dual of the classical “out-of-kilter” algorithm for flow problems. Moreover, a new proof of finiteness is provided, which holds even for non-rational data; it applies to all the algorithms of network theory which include a labeling process.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584092
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Shadow prices in nonconvex mathematical programming (1980)
    Springer
    Mathematical programming 19 (1980), S. 300-312 
    Details
    ISSN: 1436-4646
    Keywords: Equilibrium Prices ; Nonconvex Mathematical Programming ; Shadow Prices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper a definition is proposed for the concept of shadow prices in nonconvex programming. For a nonlinear program with equality and inequality constraints, existence of these prices and bounds for their possible values are obtained under the Mangasarian—Fromowitz regularity condition. Their exact values and some continuity properties are obtained under the more restrictive linear independence regularity condition. A definition of equilibrium prices is also proposed. Under convexity assumptions, all definitions and results coincide with those already known on this subject in convex programming.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581650
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Infinite retrogression in the Eaves—Saigal algorithm (1980)
    Springer
    Mathematical programming 19 (1980), S. 313-327 
    Details
    ISSN: 1436-4646
    Keywords: Retrogressing Paths ; Homotopy Method ; Fixed-point Algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For certain functionsf fromR n toR n , the Eaves—Saigal algorithm computes a path inR n × (0, 1] which converges to a zero off. In this case, it is shown that even whenf is of classC ∞ and has a unique zero, the converging path may retrogress infinitely many times.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581651
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Publications (1972)
    Springer
    Mathematical programming 2 (1972), S. 130-132 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584539
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    An algorithm for solving linearly constrained optimization problems (1972)
    Springer
    Mathematical programming 2 (1972), S. 133-165 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm for minimization of functions of many variables, subject possibly to linear constraints on the variables, is described. In it a subproblem is solved in which a quadratic approximation is made to the object function and minimized over a region in which the approximation is valid. A strategy for deciding when this region should be expanded or contracted is given. The quadratic approximation involves estimating the hessian of the object function by a matrix which is updated at each iteration by a formula recently reported by Powell [6]. This formula enables convergence of the algorithm from any feasible point to be proved. Use of such an approximation, as against using exact second derivatives, also enables a reduction of about 60% to be made in the number of operations to solve the subproblem. Numerical evidence is reported showing that the algorithm is efficient in the number of function evaluations required to solve well known test problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584540
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    On the number of solutions to a class of complementarity problems (1981)
    Springer
    Mathematical programming 21 (1981), S. 190-203 
    Details
    ISSN: 1436-4646
    Keywords: Complementarity Problem ; Cones ; Topological Degree
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the problem of establishing the number of solutions to the complementarity problem. For the case when the Jacobian of the mapping has all principal minors negative, and satisfies a condition at infinity, we prove that the problem has either 0, 1, 2 or 3 solutions. We also show that when the Jacobian has all principal minors positive, and satisfies a condition at infinity, the problem has a unique solution.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584240
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...