Keywords
Interior point methodAlgorithmLine searchKarush–Kuhn–Tucker conditionsNonlinear programmingHeuristicsFilter (signal processing)Mathematical optimizationMathematicsNonlinear systemConvergence (economics)Computer sciencePath (computing)
Affiliated Institutions
Related Publications
The processing of hexagonally sampled two-dimensional signals
Two-dimensional signals are normally processed as rectangularly sampled arrays; i.e., they are periodically sampled in each of two orthogonal independent variables. Another form...
Consensus Filters for Sensor Networks and Distributed Sensor Fusion
Consensus algorithms for networked dynamic systems provide scalable algorithms for sensor fusion in sensor networks. This paper introduces a distributed filter that allows the n...
Optuna
The purpose of this study is to introduce new design-criteria for next-generation hyperparameter optimization software. The criteria we propose include (1) define-by-run API tha...
Image and video upscaling from local self-examples
We propose a new high-quality and efficient single-image upscaling technique that extends existing example-based super-resolution frameworks. In our approach we do not rely on a...
Decoding by Linear Programming
This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted measurements y=Af+e....
Publication Info
- Year
- 2005
- Type
- article
- Volume
- 106
- Issue
- 1
- Pages
- 25-57
- Citations
- 9016
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
9016
OpenAlex
Cite This
Andreas Wächter,
Lorenz T. Biegler
(2005).
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming.
Mathematical Programming
, 106
(1)
, 25-57.
https://doi.org/10.1007/s10107-004-0559-y
Identifiers
- DOI
- 10.1007/s10107-004-0559-y