Failure of global convergence for a class of interior point methods for nonlinear programming

Keywords

MathematicsInterior point methodConvergence (economics)Nonlinear programmingMathematical optimizationClass (philosophy)Simple (philosophy)Constraint (computer-aided design)Limit pointLimit (mathematics)Nonlinear systemMeasure (data warehouse)Point (geometry)Stationary pointApplied mathematicsComputer scienceMathematical analysisGeometry

Affiliated Institutions

Carnegie Mellon University US

Related Publications

Linear Smoothers and Additive Models

Andreas Buja , Trevor Hastie , Robert Tibshirani

We study linear smoothers and their use in building nonparametric regression models. In the first part of this paper we examine certain aspects of linear smoothers for scatterpl...

1989 The Annals of Statistics 988 citations

Scattered Data Approximation

Holger Wendland

Many practical applications require the reconstruction of a multivariate function from discrete, unstructured data. This book gives a self-contained, complete introduction into ...

2004 Cambridge University Press eBooks 2534 citations

Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm

Ravi Varadhan , C. P. A. Roland

Abstract. The expectation‐maximization (EM) algorithm is a popular approach for obtaining maximum likelihood estimates in incomplete data problems because of its simplicity and ...

2008 Scandinavian Journal of Statistics 338 citations

A spectral algorithm for envelope reduction of sparse matrices

Stephen T. Barnard , Alex Pothen , Horst D. Simon

Abstract The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope‐reducing reordering is...

1995 Numerical Linear Algebra with Applica... 156 citations

Algorithm 862

Brett W. Bader , Tamara G. Kolda

Tensors (also known as multidimensional arrays or N -way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classe...

2006 ACM Transactions on Mathematical Soft... 448 citations

Publication Info

Year: 2000
Type: article
Volume: 88
Issue: 3
Pages: 565-574
Citations: 95
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Failure of global convergence for a class of interior point methods for nonlinear programming

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

OpenAlex

Cite This

APA Style

                            
                                    Andreas Wächter, 
                                
                                    Lorenz T. Biegler
                                
                            (2000). 
                            Failure of global convergence for a class of interior point methods for nonlinear programming. 
                            Mathematical Programming
                            , 88
                            (3)
                            , 565-574.
                            https://doi.org/10.1007/pl00011386

Identifiers

DOI: 10.1007/pl00011386