Error bounds and convergence analysis of feasible descent methods: a general approach
Authors:
- 1 March 1993
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 46-47 (1) , 157-178
Abstract
No abstract availableKeywords
This publication has 52 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
- On the gradient-projection method for solving the nonsymmetric linear complementarity problemJournal of Optimization Theory and Applications, 1984
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- Projection methods for variational inequalities with application to the traffic assignment problem1982
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient ProcessesSIAM Journal on Control and Optimization, 1981
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- A convex programming procedureNaval Research Logistics Quarterly, 1959