The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Projected Newton Methods for Optimization Problems with Simple Constraints
Open accessAbstract
We consider the problem $\min \{ f(x)|x \geqq 0\} $, and propose algorithms of the form $x_{k + 1} = [x_k - \alpha _k D_k \nabla f(x_k )]^ + $, where $[ \cdot ]^ + $ denotes projection on the positive orthant, $\alpha _k $ is a stepsize chosen by an Armijo-like rule and $D_k $ is a positive definite symmetric matrix which is partly diagonal. We show that $D_k $ can be calculated simply on the basis of second derivatives of f so that the resulting Newton-like algorithm has a typically superlinear rate of convergence. With other choices of $D_k $ convergence at a typically linear rate is obtained. The algorithms are almost as simple as their unconstrained counterparts. They are well suited for problems of large dimension such as those arising in optimal control while being competitive with existing methods for low-dimensional problems. The effectiveness of the Newton-like algorithm is demonstrated via computational examples involving as many as 10,000 variables. Extensions to general linearly constrained problems are also provided. These extensions utilize a notion of an active generalized rectangle patterned after the notion of an active manifold used in manifold suboptimization methods. By contrast with these methods, many constraints can be added or subtracted from the binding set at each iteration without the need to solve a quadratic programming problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Rosen, J. B. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108011 · Cited by 1,190
Constrained minimization methods
Levitin, E. S., & Polyak, B. T. (1966) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(66)90114-5 · Cited by 846
Convex programming in Hilbert space
Goldstein, A. A. (1964) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1964-11178-2 · Cited by 633
On the Goldstein-Levitin-Polyak gradient projection method
Bertsekas, D. P. (1976) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1976.1101194 · Cited by 583
Self-citationNumerical Methods for Unconstrained Optimization
G., D., & Murray, W. (1975) · Mathematics of Computation · doi:10.2307/2005592 · Cited by 571
Numerical methods for constrained optimization
Gill, P. E., & Murray, W. A. (1974) · Academic Press eBooks · Cited by 454
Goldfarb, D. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117067 · Cited by 202
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
García‐Palomares, U. M., & Mangasarian, O. L. (1976) · Mathematical Programming · doi:10.1007/bf01580366 · Cited by 125
Cited by
A Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Zhu, C., Byrd, R. H., Lu, P., & Nocedal, J. (1997) · ACM Transactions on Mathematical Software · doi:10.1145/279232.279236 · Cited by 3,462
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Projected gradient methods for linearly constrained problems
Calamai, P. H., & Moré, J. J. (1987) · Mathematical Programming · doi:10.1007/bf02592073 · Cited by 588
A class of smoothing functions for nonlinear and mixed complementarity problems
Chen, C., & Mangasarian, O. L. (1996) · Computational Optimization and Applications · doi:10.1007/bf00249052 · Cited by 505
Control-limited differential dynamic programming
Tassa, Y., Mansard, N., & Todorov, E. (2014) · 2014 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2014.6907001 · Cited by 440
Symmetric Nonnegative Matrix Factorization for Graph Clustering
Kuang, D., Ding, C., & Park, H. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.10 · Cited by 433
Error bounds and convergence analysis of feasible descent methods: a general approach
Luo, Z.-Q., & Tseng, P. (1993) · Annals of Operations Research · doi:10.1007/bf02096261 · Cited by 420
Conditional random fields for activity recognition
Vail, D. L., Veloso, M. M., & Lafferty, J. D. (2007) · Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems · doi:10.1145/1329125.1329409 · Cited by 357
On the Solution of Large Quadratic Programming Problems with Bound Constraints
Moré, J. J., & Toraldo, G. (1991) · SIAM Journal on Optimization · doi:10.1137/0801008 · Cited by 335
A limited-memory algorithm for bound-constrained optimization
Byrd, R. H., Peihuang, L., & Nocedal, J. (1996) · doi:10.2172/204262 · Cited by 313
Optimization techniques on Riemannian manifolds
Smith, S. (1995) · Hamiltonian and Gradient Flows, Algorithms and Control · doi:10.1090/fic/003/09 · Cited by 258
Metadata
- Authors
- Bertsekas, D. P.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 1982-03
- Volume
- 20
- Issue
- 2
- Pages
- 221-246
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2162988958
- Cited by
- 613
- References
- 11
- FWCI
- 10.49
- Type
- journal article
- Language
- en
- Open access
- green
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
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.