106
Views
1
CrossRef citations to date
0
Altmetric
Articles

Descent methods with computational errors in Banach spaces

&
Pages 1439-1450 | Received 09 Sep 2018, Accepted 13 Jan 2019, Published online: 25 Feb 2019

References

  • Reich S, Zaslavski AJ. Generic convergence of descent methods in Banach spaces. Math Oper Res. 2000;25:231–242. doi: 10.1287/moor.25.2.231.12226
  • Reich S, Zaslavski AJ. The set of divergent descent methods in a Banach space is σ-porous. SIAM J Optim. 2001;11:1003–1018. doi: 10.1137/S1052623400370357
  • Mordukhovich BS. Variational analysis and generalized differentiation. I: basic theory. Berlin: Springer; 2006.
  • Bačák M. A variational approach to stochastic minimization of convex functionals. Pure Appl Funct Anal. 2018;3:287–295.
  • Cegielski A. A method of projection onto an acute cone with level control in convex minimization. Math Program. 1999;85:469–490. doi: 10.1007/s101070050068
  • Curry HB. The method of steepest descent for nonlinear minimization problems. Quarterly Appl Math. 1944;2:258–261. doi: 10.1090/qam/10667
  • Gibali A, Küfer K-H, Reem D, et al. A generalized projection-based scheme for solving convex constrained optimization problems. Comput Optim Appl. 2018;70:737–762. doi: 10.1007/s10589-018-9991-4
  • Grad S-M, Pop E-L. Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone. Optimization. 2014;63:21–37. doi: 10.1080/02331934.2013.775283
  • Griva I. Convergence analysis of augmented Lagrangian – fast projected gradient method for convex quadratic problems. Pure Appl Funct Anal. 2018;3:417–428.
  • Hu Y, Li C, Yang X. On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J Optim. 2016;26:1207–1235. doi: 10.1137/140993090
  • Konnov I. On convergence properties of a subgradient method. Optim Methods Softw. 2003;18:53–62. doi: 10.1080/1055678031000111236
  • Polyak R. Exterior distance function. Pure Appl Funct Anal. 2017;2:369–394.
  • Shehu Y. A convergence analysis result for constrained convex minimization problem. Optimization. 2015;64:2587–2597. doi: 10.1080/02331934.2013.840620
  • Zaslavski AJ. Numerical optimization with computational errors. Cham: Springer; 2016.
  • Zalinescu C. On Lagrange multipliers in convex entropy minimization. Pure Appl Funct Anal. 2018;3:393–402.
  • Hiriart-Urruty J-B, Lemaréchal C. Convex analysis and minimization algorithms. Berlin: Springer; 1993.
  • Reich S, Zaslavski AJ. Genericity in nonlinear analysis. New York: Springer; 2014.
  • Zaslavski AJ. Optimization on metric and normed spaces. New York: Springer; 2010.
  • Reich S, Zaslavski AJ. regular vector-fields in Banach spaces. Taiwanese J Math. 2008;12:1165–1176. doi: 10.11650/twjm/1500574255

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.