Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 1 (1986), S. 455-482 
    ISSN: 1432-0541
    Keywords: Linear programming ; Interior method ; Barrier function ; Newton method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A simple Newton-like descent algorithm for linear programming is proposed together with results of preliminary computational experiments on small- and medium-size problems. The proposed algorithm gives local superlinear convergence to the optimum and, experimentally, shows global linear convergence. It is similar to Karmarkar's algorithm in that it is an interior feasible direction method and self-correcting, while it is quite different from Karmarkar's in that it gives superlinear convergence and that no artificial extra constraint is introduced nor is protective geometry needed, but only affine geometry suffices.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 38 (1982), S. 347-363 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D30 ; CR: 5.16
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The IMT rule, which is especially suited for the integration of functions with end-point singularities, is generalized by introducing parameters and also by repeatedly applying the parametrized IMT transformation. The quadrature formulas thus obtained are improved considerably both in efficiency and in robustness against end-point singularities. Asymptotic error estimates and numerical results are also given.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 319 (1979), S. 0 
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Notes: The principal partitions of graphs and matroids have many useful applications in engineering systems analysis and information theory. The partitions are based on the nonuniform distribution of the ranks of the minors of a matroid. This paper outlines the research carried out in Japan during the last decade with motivations from various fields of engineering science.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 52 (1991), S. 511-525 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In the feasible region of a linear programming problem, a number of “desirably good” directions have been defined in connexion with various interior point methods. Each of them determines a contravariant vector field in the region whose only stable critical point is the optimum point. Some interior point methods incorporate a two- or higher-dimensional search, which naturally leads us to the introduction of the corresponding contravariant multivector field. We investigate the integrability of those multivector fields, i.e., whether a contravariantp-vector field isX p -forming, is enveloped by a family ofX q 's (q 〉 p) or envelops a family ofX q 's (q 〈 p) (in J.A. Schouten's terminology), whereX q is aq-dimensional manifold. Immediate consequences of known facts are: (1) The directions hitherto proposed areX 1-forming with the optimum point of the linear programming problem as the stable accumulation point, and (2) there is anX 2-forming contravariant bivector field for which the center path is the critical submanifold. Most of the meaningfulp-vector fields withp ⩾ 3 are notX p -forming in general, though they envelop that bivector field. This observation will add another circumstantial evidence that the bivector field has a kind of invariant significance in the geometry of interior point methods for linear programming. For a kind of appendix, it is noted that, if we have several objectives, i.e., in the case of multiobjective linear programs, extension to higher dimensions is easily obtained.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...