The DOI matches its Crossref record.
Procedures for optimization problems with a mixture of bounds and general linear constraints
Open accessAbstract
When describing active-set methods for linearly constrained optimization, it is often convenient to treat all constraints in a uniform manner.However, in many problems the linear constraints include simple bounds on the variables as well as general constraints.Special treatment of bound constraints in the implementation of a null-space active-set method yields significant advantages in computational effort and storage requirements.In this paper, we describe a particular implementation of the constraint-related steps of a null-space active-set method when the constraint matrix is dense and bounds are treated separately.These steps involve updates to the TQ factorization of the working set of constraints and the Cholesky factorization of the projected Hessian (or Hessian approximation).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
qpOASES: a parametric active-set algorithm for quadratic programming
Ferreau, H. J., Kirches, C., Potschka, A., Bock, H. G., & Diehl, M. (2014) · Mathematical Programming Computation · doi:10.1007/s12532-014-0071-1 · Cited by 1,265
An online active set strategy to overcome the limitations of explicit MPC
Ferreau, H. J., Bock, H. G., & Diehl, M. (2008) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1251 · Cited by 608
Wealth and Happiness Revisited – Growing National Income Does Go with Greater Happiness
Hagerty, M. R., & Veenhoven, R. (2003) · Social Indicators Research · doi:10.1023/a:1024790530822 · Cited by 445
Modeling the space of camera response functions
Grossberg, M. D., & Nayar, S. K. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.88 · Cited by 299
Metadata
- Authors
- Gill, P. E., Murray, W., Saunders, M. A., & Wright, M. H.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1984-08-28
- Volume
- 10
- Issue
- 3
- Pages
- 282-298
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2082709304
- Cited by
- 220
- References
- 0
- FWCI
- 2.63
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Procedures for optimization problems with a mixture of bounds and general linear constraints. https://app.cochat.ai/papers/10.1145/1271.1276
- The paper
- Gill, P. E., Murray, W., Saunders, M. A., & Wright, M. H. (1984). Procedures for optimization problems with a mixture of bounds and general linear constraints. ACM Transactions on Mathematical Software. https://doi.org/10.1145/1271.1276
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.