Library

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: DFG German National Licenses  (1)
  • Infeasible-interior-point algorithm  (1)
  • 1
    Electronic Resource
    Electronic Resource
    A primal—dual infeasible-interior-point algorithm for linear programming (1993)
    Springer
    Mathematical programming 61 (1993), S. 263-280 
    Details
    ISSN: 1436-4646
    Keywords: Infeasible-interior-point algorithm ; interior-point algorithm ; primal—dual algorithm ; linear program ; large step ; global convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract As in many primal—dual interior-point algorithms, a primal—dual infeasible-interior-point algorithm chooses a new point along the Newton direction towards a point on the central trajectory, but it does not confine the iterates within the feasible region. This paper proposes a step length rule with which the algorithm takes large distinct step lengths in the primal and dual spaces and enjoys the global convergence.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582151
    Library Location Call Number Volume/Issue/Year 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...