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  (2)
  • Interior-point method  (2)
  • Mathematics  (2)
  • 1
    Electronic Resource
    Electronic Resource
    Primal-dual target-following algorithms for linear programming (1996)
    Springer
    Annals of operations research 62 (1996), S. 197-231 
    Details
    ISSN: 1572-9338
    Keywords: Interior-point method ; primal-dual method ; target-following ; centering ; Dikin steps
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we propose a method for linear programming with the property that, starting from an initial non-central point, it generates iterates that simultaneously get closer to optimality and closer to centrality. The iterates follow paths that in the limit are tangential to the central path. Together with the convergence analysis, we provide a general framework which enables us to analyze various primal-dual algorithms in the literature in a short and uniform way.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02206817
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Long-step primal-dual target-following algorithms for linear programming (1996)
    Springer
    Mathematical methods of operations research 44 (1996), S. 11-30 
    Details
    ISSN: 1432-5217
    Keywords: Interior-point method ; affine scaling method ; primal-dual method ; long-step method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper we propose a long-step target-following methodology for linear programming. This is a general framework, that enables us to analyze various long-step primal-dual algorithms in the literature in a short and uniform way. Among these are long-step central and weighted path-following methods and algorithms to compute a central point or a weighted center. Moreover, we use it to analyze a method with the property that starting from an initial noncentral point, generates iterates that simultaneously get closer to optimality and closer to centrality.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01246327
    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...