Interior-point algorithms for global optimization

Interior-point algorithms for global optimization

0.00 Avg rating0 Votes
Article ID: iaor19911375
Country: Switzerland
Volume: 25
Start Page Number: 189
End Page Number: 195
Publication Date: May 1990
Journal: Annals of Operations Research
Authors:
Abstract:

The paper describes recent developments in interior-point algorithms for global optimization. It will focus on the algorithmic research for nonconvex quadratic programming, linear complementarity problem, and integer programming. The paper also outlines directions in which future progress might be made.

Reviews

Required fields are marked *. Your email address will not be published.