Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- 1 January 1988
- journal article
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 17 (1) , 103-119
- https://doi.org/10.1007/bf01448362
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the convergence of projected gradient processes to singular critical pointsJournal of Optimization Theory and Applications, 1987
- Two-Metric Projection Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1984
- A class of superlinearly convergent projection algorithms with relaxed stepsizesApplied Mathematics & Optimization, 1984
- Newton?Goldstein convergence rates for convex constrained minimization problems with singular solutionsApplied Mathematics & Optimization, 1984
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- ITERATIVE ALGORITHMS FOR SINGULAR MINIMIZATION PROBLEMSPublished by Elsevier ,1981
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization ProblemsSIAM Journal on Control and Optimization, 1980
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964